| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- BFS
- sql
- mysql
- coding test
- 코딩
- import re
- python
- 코딩테스트
- collections
- 데이터분석
- Queue
- 완전탐색
- 연습문제
- Stack
- counter
- 시간복잡도
- 조합
- coding
- Level2
- join
- 프로그래머스
- cte
- itertools
- level4
- lv4
- lambda
- 코테
- time complexity
- 파이썬
- programmers
- Today
- Total
목록hackerrank (1)
ror_coding
[HackerRank] Binary Tree Nodes
WITH RECURSIVE (CTE) 로 Level 구하기 !!! 매우 중요! Question You are given a table, BST, containing two columns: N and P, where N represents the value of a node in Binary Tree, and P is the parent of N.Write a query to find the node type of Binary Tree ordered by the value of the node. Output one of the following for each node:Root: If node is root node.Leaf: If node is leaf node.Inner: If node is neith..
Algorithm/SQL
2025. 4. 5. 17:59