2014 年 3月 27 日随笔档案 - ying_vincent

2014年3月27日

Data Structure Binary Tree: Inorder Tree Traversal without Recursion

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

posted @ 2014-03-27 13:09 ying_vincent 阅读(146) 评论(0) 推荐(0)

Data Structure Binary Tree: How to determine if a binary tree is height-balanced?

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

posted @ 2014-03-27 12:23 ying_vincent 阅读(168) 评论(0) 推荐(0)

Data Structure Binary Tree: Diameter of a Binary Tree

摘要： 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), ... 阅读全文

posted @ 2014-03-27 12:12 ying_vincent 阅读(144) 评论(0) 推荐(0)

Data Structure Binary Tree: Convert an arbitrary Binary Tree to a tree that holds Children Sum Property

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

posted @ 2014-03-27 10:40 ying_vincent 阅读(273) 评论(0) 推荐(0)

Data Structure Binary Tree: Check for Children Sum Property in a Binary Tree

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

posted @ 2014-03-27 10:21 ying_vincent 阅读(150) 评论(0) 推荐(0)

Data Structure Binary Tree: Level order traversal in spiral form

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

posted @ 2014-03-27 09:52 ying_vincent 阅读(175) 评论(0) 推荐(0)