【java】700. Search in a Binary Search Tree

问题原文https://leetcode-cn.com/problems/search-in-a-binary-search-tree/description/

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);
    }

猜你喜欢

转载自blog.csdn.net/amber804105/article/details/81132756