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. 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
Get step-by-step solutions from verified subject matter experts
