2016年5月22日
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. 阅读全文
posted @ 2016-05-22 21:18 Adding 阅读(124) 评论(0) 推荐(0) 编辑
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
摘要： /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { pu... 阅读全文
posted @ 2016-05-22 16:03 Adding 阅读(448) 评论(0) 推荐(0) 编辑