*코드 class Solution { public TreeNode searchBST(TreeNode root, int val) { if (root == null || root.val == val) { return root; }
if (val < root.val) { return searchBST(root.left, val); } return searchBST(root.right, val); }
} *오늘의 회고