2020年1月9日
[LC] 106. 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. For example, 阅读全文
posted @ 2020-01-09 13:16 xuan_abc 阅读(119) 评论(0) 推荐(0)
[LC] 105. 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. For example, 阅读全文
posted @ 2020-01-09 12:23 xuan_abc 阅读(133) 评论(0) 推荐(0)
[LC] 108. Convert Sorted Array to Binary Search Tree
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2020-01-09 11:43 xuan_abc 阅读(119) 评论(0) 推荐(0)