Answer Happy

Parenthetical Listing = each set of open parenthesis indicates the start of a new depth; each closing parenthesis completes the current depth and moves up one level in the tree.
if not sure than ignore parenthetical listing
Insert a node given an integer into the tree. Delete the node in the tree given an integer. If the node does not exist in the tree, then let the user know. • Print the values in the tree in ascending order. You need to add: (Please use exact spelling and parameters so I can include it in my test program. • void printParenthetical(node* root); // Print the tree using parenthetical notation. • node* searchNode(node* root, int key); // Given an integer, return the node pointer for the node that has that integer as an attribute. • int findSmallest(node* root); // returns the smallest value in the BST. • int find Largest(node* root); // returns the smallest value in the BST.