Inserting in a BST

Exercises 3.5, 3.6 and 3.7

Before doing this block of exercises you might want to revise the definition of Binary Search Trees.

Exercise 3.5

Are the following trees are Binary Search Trees (BST)? Yes? No? Why?

Exercise 3.6

Starting from an empty binary search tree, insert using the classic algorithm, one after the other, the sequence of keys
32
15
47
67
78
39
63
21
12
27

Exercise 3.7

Starting from an empty binary search tree, insert using the classic algorithm, one after the other, the sequence of keys
12
15
21
27
32
39
47
63
67
78