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. *

Answer 1

Answer:

the root of a binery tree and value

Answer 2

• All nodes in the left subtree of a node have values less than the node's value.
• All nodes in the left subtree of a node have values less than the node's value.All nodes in the right subtree of a node have values greater than the node's value.
• All nodes in the left subtree of a node have values less than the node's value.All nodes in the right subtree of a node have values greater than the node's value.Both left and right subtrees are also binary search trees.