Example: Ordered Binary Tree

K

Q

Insert W?

T

M

H

Invariants: 0,1,2 children

left subtrees alphabetically < parent

right subtrees alphabetically > parent

G

F

A

D

Previous slide

Next slide

Back to first slide

View graphic version