Question

Build a binary search tree for the word’s banana, peach, apple, pear, coconut, mango, and papaya using alphabetical order.

Short answer

Given,

The first word is banana, make it as the root.

Now given second word is peach,so it is greater than banana then move towards right, here, no child on the right of banana. So, keep there.

The third word is apple, compare it with banana.

Then we say that apple is less than banana so move it towards the left and no child over there. So,keep it as the left child of banana.

Now the next word is pear, compare it with banana, pear is greater than banana then move towards right. Compare it with peach, utopia' both are equal but r is greater than c, so move towards right side of peach and no child over there so insert there.

Next word is coconut, which is greater than banana so move towards right of banana but less than peach, so it should be in the left of peach, no child present there, so insert there.

Next word mango is greater than banana, so move towards right of banana, compare it with peach in which mango is less than peach. So, move towards the left of peach. On the left now compare it with coconut, mango is greater than coconut so insert it as the right child of coconut

Step-by-step solution

Firstly, use the given information and make a tree.

Given,

The first word is banana, make it as the root.

Now given second word is peach,so it is greater than banana then move towards right, here, no child on the right of banana. So, keep there.

The third word is apple, compare it with banana.

Then we say that apple is less than banana so move it towards the left and no child over there. So,keep it as the left child of banana.

Now the next word is pear, compare it with banana, pear is greater than banana then move towards right. Compare it with peach, utopia' both are equal but r is greater than c, so move towards right side of peach and no child over there so insert there.

Next word is coconut, which is greater than banana so move towards right of banana but less than peach, so it should be in the left of peach, no child present there, so insert there.

Next word mango is greater than banana, so move towards right of banana, compare it with peach in which mango is less than peach. So, move towards the left of peach. On the left now compare it with coconut, mango is greater than coconut so insert it as the right child of coconut

Final conclusion.

Last word is papaya, which is greater than banana, so move towards the right compare with peach. Papaya is less than peach so move towards left side of peach. Compare it with coconut. Papaya is greater than coconut so move towards right side and compare with mango. Papaya is greater than mango, so will be added as the right child of mango.

Thus, the whole binary search tree will be like: