QUESTION 4 (16 points) Write a C++ function which element of a given Binary Search Tree Details: 20 . The function operates at the “node level” It returns a pointer to the root of the resulting tree after deletion . If the tree is empty, nothing happens (code already given) It does not actually report the deleted value in any way – it just gets rid of it Runtime O(h) where h is the
OR
OR