摘要：
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... 阅读全文
posted @ 2014-03-28 12:14
ying_vincent
阅读(219)
评论(0)
推荐(0)
摘要：
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), ... 阅读全文
posted @ 2014-03-28 10:55
ying_vincent
阅读(144)
评论(0)
推荐(0)
浙公网安备 33010602011771号