C++

Complete the Add method of the Binary Search Tree. Assume all input values are unique.

class Node { public: Node* left; Node* right; int value; Node(int Value) { left = null; right = null; value = Value; } } class BST { private: Node* root; public: BST() { root = null; } Node* Add( int newValue ) { // return pointer to added Node.

.

.

. } }