🍥

XT 的技术博客

If you aren't proud of it, it isn't good enough.

Tags

27 pages

tree

[Leetcode]106. Construct Binary Tree from Inorder and Postorder Traversal(C++)

[Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal (C++)

[Leetcode]114. Flatten Binary Tree to Linked List(C++)

[Leetcode]230. Kth Smallest Element in a BST(C++)

[Leetcode]173. Binary Search Tree Iterator(C++)