[LeetCode] 700. Search in a Binary Search Tree - Java

• 문제 링크

Search in a Binary Search Tree - LeetCode

 

• 풀이 코드

public class Solution {

    public TreeNode searchBST(TreeNode root, int val) {
        if (root == null || root.val == val) return root;

        return root.val > val ? searchBST(root.left, val) : searchBST(root.right, val);
    }

}