###### Algorithms

October 12, 2023###### Algorithms

October 12, 2023# Algorithms

Question 44 |

The numbers 1, 2, …. n are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains p nodes. The first number to be inserted in the tree must be

p | |

p + 1 | |

n – p | |

n – p + 1 |

Question 44 Explanation:

Total element = n

RST contains elements = p

Root contains = 1 element

1

Root contains the value is n – p.

RST contains elements = p

Root contains = 1 element

1

^{st}contains = n – (p + 1) elementRoot contains the value is n – p.

Correct Answer: C

Question 44 Explanation:

Total element = n

RST contains elements = p

Root contains = 1 element

1

Root contains the value is n – p.

RST contains elements = p

Root contains = 1 element

1

^{st}contains = n – (p + 1) elementRoot contains the value is n – p.

Subscribe

Login

0 Comments