Binary search tree (BST) is a binary tree where the value of each node is larger or equal to the values in all the nodes in that node's left subtree and smaller than the values in all the nodes in that node's right subtree.
Write a function that, efficiently with respect to time used, returns 1 if a given binary search tree contains a given value, else 0.
For example, for the following tree:
- n1 (Value: 1, Left: null, Right: null)
- n2 (Value: 2, Left: n1, Right: n3)
- n3 (Value: 3, Left: null, Right: null)
Call to contains(&n2, 3) should return 1 since a tree with root at n2 contains number 3.
- Example case: Wrong answer
- Correctness: Wrong answer
- Performance test on a large tree: Wrong answer