Home of real teaching & learning
  • Full support for teachers
  • Focus on critical thinking
  • Engaging classroom activities
  • Integrated student eBook
  • Assessed tasks / qBank
  • Practice exam questions
Find out more Download brochure

The InThinking Guarantee: Our sites are written by expert practitioners and not by AI

See our AI policy

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

Don't miss out, find out!

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. Any of the following: 1,25, 45, 85...

Help