We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8b6b96a commit 7e78f2aCopy full SHA for 7e78f2a
validate-binary-search-tree/devyulbae.py
@@ -0,0 +1,18 @@
1
+"""
2
+Blind 75 - LeetCode Problem 98: Validate Binary Search Tree
3
+https://leetcode.com/problems/validate-binary-search-tree/
4
+이진 탐색 트리인지 확인하기
5
+
6
7
+from typing import Optional
8
9
+# Definition for a binary tree node.
10
+class TreeNode:
11
+ def __init__(self, val=0, left=None, right=None):
12
+ self.val = val
13
+ self.left = left
14
+ self.right = right
15
16
+class Solution:
17
+ def isValidBST(self, root: Optional[TreeNode]) -> bool:
18
0 commit comments