| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- tableau
- 프로그래머스
- Growth hacking
- time complexity
- level4
- lv4
- Queue
- join
- python
- 코테
- itertools
- Level2
- hackerrank
- 조합
- AARRR
- cte
- programmers
- mysql
- import re
- coding test
- 코딩테스트
- 완전탐색
- lambda
- 파이썬
- counter
- Stack
- LeetCode
- sql
- coding
- 코딩
Archives
- Today
- Total
목록node (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..
Coding Test/SQL
2025. 4. 5. 17:59