Write program that creates a binary search tree using the BST class developed in previous task. Create non-member standalone functions to implement the following.

1. Given an integer value, print the path of the node (i.e. all nodes traversed from the root till the said node).
2. Find the maximum value in the BST.
3. Given an integer value, find the value of its sibling node.

Answer rating: 100% (QA)

Solution CODE include include using namespace std class Node pu... View the full answer