4 of 6 6. Using the binary tree node from textbook, write an iterative function (no recursion) to meet the following specification. You do not need to check the precondition. Make the function as efficient as possible (do not visit nodes unnecessarily) (10 points) template int max (binary tree node root ptr) /Precondition: root_ptr is the root pointer of a nonempty binary SEARCH tree / Postcondition: The return value is the largest value in the tree. 7. Remove K from the following binary search tree. Be sure to show all steps. (10 points)