Binary Search Tree

描述

我们可以用sorted array来存储数据并进行binary search, 但是add & delete到array 里并且维护array sorted太expensive了。

Binary Search Tree也可以存储sorted values, 并且而已efficiently add & delete.

BST offer the ability:

• search for a key
• find the min and max elements
• look for successor or predecessor of a search key
• enumerate the keys in a range in sorted order

题目列表

一般思路

Reference