Binary Tree Nodes MySQL

 

문제

https://www.hackerrank.com/challenges/binary-search-tree-1/problem

Binary Tree Nodes | HackerRank

풀이

• CASE문과 서브쿼리를 이용한다.

SELECT N, 
CASE WHEN P IS NULL THEN 'Root'
WHEN N NOT IN (SELECT DISTINCT P FROM BST WHERE P IS NOT NULL) THEN 'Leaf'
ELSE 'Inner' END 
FROM BST
ORDER BY N

 

참조

https://jogrammer.tistory.com/249

[해커랭크(HackerRank)] Binary Tree Nodes (MySQL)