Write a recursive function named search that takes as input the pointer to the root of a

Question:

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 value K appears in the tree and false otherwise.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: