Question: Just do this in hands. No need to use a software. 6. Write a recursive function named search that takes as input the pointer to

Just do this in hands. No need to use a software.
6. Write a recursive function named search that takes as input the pointer to the root of a binary tree (not a BST!) and a value K, and returns true if the value K is found and false otherwise. (5 pts)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
