Sail E0 Webinar
Question
How will you find the minimum element in a binary search tree?
Options:
A .  public void min(Tree root){
B .  public void min(Tree root){
C .  public void min(Tree root){
D .  public void min(Tree root){
Answer: Option A


Since all the elements lesser than a given node will be towards the left, iterating to the leftmost leaf of the root will give the minimum element in a binary search tree.



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers