feat: review "validate-binary-search-tree"

shinsj4653 · shinsj4653 · commit 04d4401bc6d6 · 2025-04-12T23:21:17.000+09:00
diff --git a/valid-palindrome/shinsj4653.py b/valid-palindrome/shinsj4653.py
@@ -0,0 +1,13 @@
+"""
+[문제풀이]
+# Inputs
+
+# Outputs
+
+# Constraints
+
+# Ideas
+
+[회고]
+
+"""
diff --git a/validate-binary-search-tree/shinsj4653.py b/validate-binary-search-tree/shinsj4653.py
@@ -73,8 +73,7 @@ def isValidBST(self, root: Optional[TreeNode]) -> bool:
 결국 풀이 참고
 
 [회고]
-
-
+상한값, 하한값 까지 넘기는 사고 장착하기! 복습 또 복습!
 """
 
 # Definition for a binary tree node.
