/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
/**
直接在leetcode的这个方法如此写,可直接在找到目标节点时,将对应节点返给接收者
*/
public TreeNode searchBST(TreeNode root, int val) {
if(root == null){
return null;
}
if(val < root.val){
return searchBST(root.left, val);
}
if(val == root.val){
return root;
}
if(val > root.val){
return searchBST(root.right, val);
}
return null;
}
}