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

2014年3月29日

Data Structure Binary Tree: Lowest Common Ancestor in a Binary Tree

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

posted @ 2014-03-29 16:35 ying_vincent 阅读(177) 评论(0) 推荐(0)

Data Structure Binary Tree: Print ancestors of a given binary tree node without recursion

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

posted @ 2014-03-29 13:50 ying_vincent 阅读(166) 评论(0) 推荐(0)

Data Structure Binary Tree: Convert a given Binary Tree to Doubly Linked List

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

posted @ 2014-03-29 11:59 ying_vincent 阅读(188) 评论(0) 推荐(0)

Data Structure Binary Tree: Iterative Postorder Traversal

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

posted @ 2014-03-29 10:16 ying_vincent 阅读(159) 评论(0) 推荐(0)

Data Structure Binary Tree: Largest Independent Set Problem

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

posted @ 2014-03-29 07:31 ying_vincent 阅读(185) 评论(0) 推荐(0)

Data Structure Binary Tree: Morris traversal for Preorder

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

posted @ 2014-03-29 07:02 ying_vincent 阅读(179) 评论(0) 推荐(0)

Data Structure Binary Tree: Construct Full Binary Tree from given preorder and postorder traversals

摘要： http://www.geeksforgeeks.org/full-and-complete-binary-tree-from-given-preorder-and-postorder-traversals/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 struct node {12 int data;13 struct node *left, *right;14 no... 阅读全文

posted @ 2014-03-29 06:46 ying_vincent 阅读(165) 评论(0) 推荐(0)

Data Structure Binary Tree: Boundary Traversal of binary tree

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

posted @ 2014-03-29 04:37 ying_vincent 阅读(173) 评论(0) 推荐(0)

Data Structure Binary Tree: Convert a given tree to its Sum Tree

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

posted @ 2014-03-29 03:22 ying_vincent 阅读(158) 评论(0) 推荐(0)

Data Structure Binary Tree: Populate Inorder Successor for all nodes

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

posted @ 2014-03-29 03:09 ying_vincent 阅读(205) 评论(0) 推荐(0)

Data Structure Binary Tree: Connect nodes at same level using constant extra space

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

posted @ 2014-03-29 02:50 ying_vincent 阅读(209) 评论(0) 推荐(0)

Data Structure Binary Tree: Check if a given Binary Tree is SumTree

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

posted @ 2014-03-29 01:52 ying_vincent 阅读(207) 评论(0) 推荐(0)