摘要： http://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 int data;12 struct node *left, *right;13 node() : data(0), left(NULL), right(NULL) { }14 node... 阅读全文

摘要： http://www.geeksforgeeks.org/populate-inorder-successor-for-all-nodes/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 int data;12 struct node *left, *right, *next;13 node() : data(0), left(NULL), right(NULL)... 阅读全文

摘要： http://www.geeksforgeeks.org/connect-nodes-at-same-level-with-o1-extra-space/recursive: 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 int data;12 struct node *left, *right, *next;13 node() : data(0), left(N... 阅读全文

摘要： http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-sumtree/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 int data;12 struct node *left, *right;13 node() : data(0), left(NULL), right(NULL) { }14 ... 阅读全文

摘要： http://www.geeksforgeeks.org/construct-tree-from-given-inorder-and-preorder-traversal/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 char data;12 struct node *left, *right;13 node() : data(0), left(NULL), r... 阅读全文

摘要： http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion-and-without-stack/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 struct node {11 int data;12 struct node *left, *right;13 node() : data(0), left(NULL), ... 阅读全文

摘要： http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 struct node { 9 int data;10 struct node *left, *right;11 node() : data(0), left(NULL), right(NULL) { }12 node(int d) : data(d... 阅读全文

摘要： http://www.geeksforgeeks.org/how-to-determine-if-a-binary-tree-is-balanced/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 struct node { 9 int data;10 struct node *left, *right;11 node() : data(0), left(NULL), right(NULL) { }12 node(int d) : d... 阅读全文

摘要： http://www.geeksforgeeks.org/diameter-of-a-binary-tree/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 struct node { 9 int data;10 struct node *left, *right;11 node() : data(0), left(NULL), right(NULL) { }12 node(int d) : data(d), left(NULL), ... 阅读全文

摘要： http://www.geeksforgeeks.org/convert-an-arbitrary-binary-tree-to-a-tree-that-holds-children-sum-property/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 struct node { 9 int data;10 struct node *left, *right;11 node() : data(0), left(NULL), right(N... 阅读全文