700. 二叉搜索树中的搜索

简单

题目描述

Java

class Solution {
    public TreeNode searchBST(TreeNode root, int val) {
        if(root == null) return null;
        if(root.val == val) return root;
        else if (root.val > val) {
            return searchBST(root.left,val);
        }else {
            return searchBST(root.right,val);
        }
    }
}

Ts

function searchBST(root: TreeNode | null, val: number): TreeNode | null {
    if(root == null) return null;
    if(root.val == val) return root;
    else if (root.val > val) {
        return searchBST(root.left,val);
    }else {
        return searchBST(root.right,val);
    }
};