Question

Please does anyone knows the answer:
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

Explanation:

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.

please mark me as a brainliest

Answer 2

Answer:

this value sub tree commenly i can belive tree rightly

Explanation:

this memeber commenly agein sub tree value zero