Binary Tree Search - Implementation
Question
Develop a binary tree by adding the values: 55, 29, 87, 42, 20, 60, 91.
Then implement the searching function to find the given value by users. If the searching
value is not available in the tree return the error message.