2015年7月29日
Unique Binary Search Tree
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2015-07-29 23:27 amazingzoe 阅读(156) 评论(0) 推荐(0)
Construct Binary Tree From Inorder and Postorder Traversal
摘要： Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Analyse: The l... 阅读全文
posted @ 2015-07-29 21:27 amazingzoe 阅读(170) 评论(0) 推荐(0)
Construct Binary Tree From Preorder and Inorder Traversal **
摘要： Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.Analyse: We can... 阅读全文
posted @ 2015-07-29 20:22 amazingzoe 阅读(214) 评论(0) 推荐(0)