Group B1 (Binary Search Tree)
Beginning with an empty binary search tree, Construct binary search tree by inserting the values in the order given. After constructing a binary tree -
i. Insert new node,
ii. Find number of nodes in longest path from root,
iii. Minimum data value found in the tree,
iv. Change a tree so that the roles of the left and right pointers
are swapped at every node,
v. Search a value

Answer rating: 100% (QA)

The detailed answer for the above question is provided below using namespace std include class node ... View the full answer