OJ
Search...
Ctrl + K
Binary Tree & Divide Conquer
Binary Search Tree
左孩子比父节点小,右孩子比父节点大,还有一个特性就是”中序遍历“可以让结点有序。
Previous
Binary Tree & Divide Conquer
Next
1008. Construct Binary Search Tree from Preorder Traversal
Last updated
5 years ago
Was this helpful?