##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Find a node by value
Given the root of a BST and an integer val, find the node with that value and return the subtree rooted at that node. If the node doesn't exist, return null.
Example: In BST , searching for 2 returns subtree . You're implementing the most basic BST operation.
Use the BST property to decide which direction to search. Constraints: up to nodes, values from to .
