Finish the Add method for the following Binary Search Tree. (all input values should be 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: BSTO { root = null; } Node* Add int newValue) { // return pointer to added Node. } }