Leetcode practice  0.0
binary_tree.h
Go to the documentation of this file.
1 #ifndef ARRAY_BINARY_TREE_H_
2 #define ARRAY_BINARY_TREE_H_
3 
4 #include <vector>
5 
6 using namespace std;
7 
8 //Definition for a binary tree node.
9 typedef struct TreeNode_T {
10  // Default of Node Tree
11  int val;
14  TreeNode_T(int x) : val(x), left(NULL), right(NULL) {}
15 }TreeNode;
16 
17 
19 private:
20 public:
21  TreeNode* newNode(int val);
22  void printinOrder(TreeNode *root);
23  TreeNode* insertNode(int arr[], TreeNode* root, int idx, int size);
24  bool findtwosumTarget(TreeNode* root, int target);
25  void storinginOrder(TreeNode *root, vector<int> & num);
26 };
27 
28 void binary_tree_main();
29 
30 #endif /* ARRAY_BINARY_TREE_H_ */
Definition: binary_tree.h:9
TreeNode_T(int x)
Definition: binary_tree.h:14
void binary_tree_main()
Definition: binary_tree.cpp:6
TreeNode_T * left
Definition: binary_tree.h:12
Definition: binary_tree.h:18
TreeNode_T * right
Definition: binary_tree.h:13
struct TreeNode_T TreeNode
int val
Definition: binary_tree.h:11