Binary Search Tree Dictionary Data Structure

4

12

10

6

2

11

5

8

14

13

7

9

• Binary tree property

  • each node has ? 2 children
  • result:
    • storage is small
    • operations are simple
    • average depth is small

• Search tree property

  • all keys in left subtree smaller than root’s key
  • all keys in right subtree larger than root’s key
  • result:
    • easy to find any given key

Previous slide

Next slide

Back to first slide

View graphic version