Algorithm Workbench
Assume that data is stored in a binary tree but that unlike in the case of binary search tree, no attempt is made to maintain any sort of order in the data stored. Give an algorithm for a function search that searches a binary tree for a particular value num and returns true or false according to whether the value num is found in the tree.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.