[Solved]-Question 1 Justify Answers 4 Points Part Total 32 Points Bst Ordered Tree Non Null Node T Q37209732

Could you help with H please. Thanks

Question A.1 Justify All Answers (4 Points Each Part). TOTAL 32 Points (a) Why is a BST not “just an ordered tree where each non-null node 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) Define a pseudo-BST to be one in which every non-null node u satisfies u.key > uL-key (if uLメ) and u·key < uR-key (if uRメ). Draw a pseudo-BST of size n S 4 that is not a BST. (e) Draw the same of all AVL trees of size n = 5 (f) Consider the BST in Figure 11.1 (p.460). List all its key in pre-order g) Repeat the last question, but listing the keys in post-order (h) Let us call a BST a leftist tree if each non-leaf has a left child and no right child. Similarly, we may define a rightist tree. How many rotations do you need transform a leftist tree to a rightist tree? Show transcribed image text Question A.1 Justify All Answers (4 Points Each Part). TOTAL 32 Points (a) Why is a BST not “just an ordered tree where each non-null node 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) Define a pseudo-BST to be one in which every non-null node u satisfies u.key > uL-key (if uLメ) and u·key

Expert Answer

---

Answer to Question A.1 Justify All Answers (4 Points Each Part). TOTAL 32 Points (a) Why is a BST not “just an ordered tree where … . . .