LeetCode题解之 Search in a Binary Search Tree

 1 TreeNode* searchBST(TreeNode* root, int val) {
 2         if (root == NULL)
 3             return NULL;
 4         else if (root->val > val)
 5            return  searchBST(root->left, val);
 6         else if (root->val < val)
 7            return  searchBST(root->right,val);
 8         else 
 9             return root;
10     }