摘要:
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 ... 阅读全文