Inserting to Binary Search Trees

S = ɜ,2,8,9,7,1>

4

4

2

4

2

8

9

4

2

8

4

2

8

9

7

4

2

8

1

9

7

4

2

8

9

7

1

Previous slide

Next slide

Back to first slide

View graphic version