Login/RegisterData Structures :: Trees - Discussion
Home > Data Structures > Trees > MCQs Questions Discussion
21 / 194
Choose the correct option.
Assume that a structure for a Binary Search Tree exists. What does the following function do?
int function(root)
{
current = root;
while (current->left != NULL)
{
current = current->left;
}
return(current->data);
} ?
Aleft most child of BST
Bright most child of BST
CIt gives a compilation error
DNone of these
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!
