250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록validate bst (1)
N
(Leet Code JS)Validate Binary Search
98. Validate Binary Search Tree 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 search trees. Example ..
Leet Code 알고리즘
2021. 9. 6. 11:08