You are given the root
of a binary search tree (BST) and an integer val
.
Find the node in the BST that the node's value equals val
and return the subtree rooted with that node. If such a node does not exist, return null
.
Example One:
Input: root = [4,2,7,1,3], val = 2
Output: [2,1,3]
Example Two:
Input: root = [4,2,7,1,3], val = 5
Output: []
Solution:
class Solution {
public TreeNode searchBST(TreeNode root, int val) {
/**
Recursion Solution:
if (root == null) return null;
else if(root.val == val) return root;
else if(val > root.val){
return searchBST(root.right, val);
} else{
return searchBST(root.left, val);
}
*/
while(root != null){
if(val > root.val){
root = root.right;
}
else if(val < root.val){
root = root.left;
}else{
return root;
}
}
return null;
}
}