Question: What will the following code do on a Binary Search Tree. int fun(root) { current = root; while (current->leftChild = NULL) current = current->leftChild; return

 What will the following code do on a Binary Search Tree.

What will the following code do on a Binary Search Tree. int fun(root) { current = root; while (current->leftChild = NULL) current = current->leftChild; return (current->data); } O A. Find minimum element OB. Searching an element OC. Find maximum element OD. Preorder traversal

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!