[Solved]-Question 1 Bst Ordered Tree Non Null Node Two Children B Draw Binary Trees Size 4 Height 3 Q37271419

Question 1

a) Why is a BST not “just an ordered tree where each non-nullnode has at most two children”?

b) Draw all the binary trees of size 4 and height 3.

c) Draw all the BST’s of height 2 containing these keys: 1, 2,3, 4.

d) Let us call a BST a leftist tree if each non-leaf has a leftchild and no right child. Similarly, we may define a rightist tree.How many rotations do you need to transform a leftist tree to arightist tree?

Expert Answer

---

Answer to Question 1 a) Why is a BST not “just an ordered tree where each non-null node has at most two children”? b) Draw all… . . .