[LeetCode] 700. Search in a Binary Search Tree - 문제풀이
Description 주어진 이진검색트리(BST)에서 val와 같은 값을 가지는 노드를 반환하는 문제입니다. You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not exist, return null. Example 1: Input: root = [4,2,7,1,3], val = 2 Output: [2,1,3] Example 2: Input: root = [4,2,7,1,3], val = 5 Output: ..
