Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | ||||
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| 18 | 19 | 20 | 21 | 22 | 23 | 24 |
| 25 | 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- 문자열
- binary search
- 리트코드
- math
- Medium
- Depth-first Search
- list
- 중간
- 쉬움
- linked list
- 이진트리
- string
- matrix
- easy
- DP
- Python
- hash table
- two pointers
- 미디움
- backtracking
- dfs
- HashTable
- tree
- 재귀
- leetcode
- Array
- sorting
- Binary
- binary tree
- recursive
Archives
- Today
- Total
목록leetcode 98 (1)
부부의 코딩 성장 일기
LeetCode 98(Validate Binary Search Tree, Python)
1. 문제 링크 https://leetcode.com/problems/validate-binary-search-tree/ Validate Binary Search Tree - LeetCode Can you solve this real interview question? 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 le leetcode.com 2. 문제 설명 주어진 tree가 이진..
Algorithm/LeetCode
2024. 2. 19. 19:00