2014年7月15日
LeetCode Construct Binary Tree from Inorder and Postorder Traversal
摘要： class Solution {public: TreeNode *buildTree(vector &inorder, vector &postorder) { int ilen = inorder.size(); int plen = postorder.siz... 阅读全文
posted @ 2014-07-15 18:13 卖程序的小歪 阅读(176) 评论(0) 推荐(0) 编辑
LeetCode Construct Binary Tree from Preorder and Inorder Traversal
摘要： class Solution {public: TreeNode *buildTree(vector &preorder, vector &inorder) { int plen = preorder.size(); int ilen = inorder.size(... 阅读全文
posted @ 2014-07-15 16:25 卖程序的小歪 阅读(137) 评论(0) 推荐(0) 编辑
LeetCode Convert Sorted List to Binary Search Tree
摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *... 阅读全文
posted @ 2014-07-15 10:38 卖程序的小歪 阅读(150) 评论(0) 推荐(0) 编辑
LeetCode Convert Sorted Array to Binary Search Tree
摘要： /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文
posted @ 2014-07-15 10:11 卖程序的小歪 阅读(129) 评论(0) 推荐(0) 编辑