InThinking Subject Sites

Subscription websites for IB teachers & their classes

Find out more


Sitemap
Recommendations
Other subjects
Brochure

Disclaimer: InThinking subject sites are neither endorsed by nor connected with the International Baccalaureate Organisation.

Student access tools
 You need to log-in or subscribe in order to use Student access.

Question 5.3 - Trees

Consider the following binary search tree (BST)(a) State the value of one leaf node. [1 mark](b) State the value of one parent node. [1 mark](c) State the value of the root node. [1 mark](d) State the result of an inorder traversal [1 mark](e) Draw the resulting BST after the deletion of the node containing the value 67. [1 mark]Answers(a) State the value of one leaf node.

To access the contents of this site, you must subscribe.

Help