2019年10月28日
[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 @ 2019-10-28 10:57 xuan_abc 阅读(76) 评论(0) 推荐(0)
[LC] 426. Convert Binary Search Tree to Sorted Doubly Linked List
摘要： Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers i 阅读全文
posted @ 2019-10-28 02:19 xuan_abc 阅读(103) 评论(0) 推荐(0)