Search in a Binary Search Tree
Given the root node of a binary search tree(BST)and a value.
You need to find the node in the BST that the node's value equals
the given value. Return the subtree rooted with that node.
If such node doesn't exist, you should returnNULL.
For example,
Given the tree:4/ \
27/ \
13
And the value to search:2
You should returnthis subtree:2/ \
13
In the example above,if we want to search the value 5, since there is no node with value 5, we should returnNULL.
Note that an empty tree is represented by NULL, therefore you would see the expected output(serialized tree format) as [],not null.