[Solved]-Question 3 Answer Following Questions Binary Search Tree Stores Character Elements 4 Marks Q37270543

C++ / Data Structures //Will thumbs up if you provide a correctanswer, thanks.

Question 3: (a) Answer each of the following questions about the Binary Search Tree below, which stores character elements. (4 marks) (i) Is this tree complete? State why (or not) exactly. (ii) In which order would items be printed if using pre-order traversal? (iii) Which characters could be inserted in the node ‘H’ subtree and where? (iv) What will happen exactly if we delete the root node ‘K’? (b) Give four distinct examples of Binary Search Tree functions that must employ pre-order traversal (for optimal performance). (I mark) Show transcribed image text Question 3: (a) Answer each of the following questions about the Binary Search Tree below, which stores character elements. (4 marks) (i) Is this tree complete? State why (or not) exactly. (ii) In which order would items be printed if using pre-order traversal? (iii) Which characters could be inserted in the node ‘H’ subtree and where? (iv) What will happen exactly if we delete the root node ‘K’? (b) Give four distinct examples of Binary Search Tree functions that must employ pre-order traversal (for optimal performance). (I mark)

Expert Answer

---

Answer to Question 3: (a) Answer each of the following questions about the Binary Search Tree below, which stores character elemen… . . .