previous |
start |
next
Binary Search Tree
- There is no insertion position
- You can not select the position at which to insert an
element
- The structure is self-organizing
- Each element finds its own place
- If it is approximately balanced, then adding an element takes
O(log(n)) time
previous |
start |
next