[Leetcode] 98. Validate Binary Search Tree - 문제풀이 Description 주어진 이진트리가 유효한 이진탐색트리인지 여부를 반환하는 문제입니다. Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary sea.. 알고리즘/LeetCode 2022. 2. 14. 13:45
