摘要:
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... 阅读全文
摘要:
http://www.geeksforgeeks.org/check-for-children-sum-property-in-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) ... 阅读全文
摘要:
http://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ 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), l... 阅读全文