"HR-SQL Binary Tree Nodes"의 두 판 사이의 차이

19번째 줄: 19번째 줄:
SELECT N, CASE
SELECT N, CASE
     WHEN P IS NULL THEN 'Root'  
     WHEN P IS NULL THEN 'Root'  
     WHEN (SELECT COUNT(*) FROM BST WHERE P=A.N)=0 THEN 'Leaf'
     WHEN (SELECT COUNT(*) FROM BST WHERE P=A.N) = 0 THEN 'Leaf'
     ELSE 'Inner'
     ELSE 'Inner'
END
END
28번째 줄: 28번째 줄:
SELECT N, CASE
SELECT N, CASE
     WHEN P IS NULL THEN 'Root'  
     WHEN P IS NULL THEN 'Root'  
     WHEN(SELECT COUNT(*) FROM BST WHERE P=A.N) > 0 THEN 'Inner'
     WHEN (SELECT COUNT(*) FROM BST WHERE P=A.N) > 0 THEN 'Inner'
     ELSE 'Leaf'
     ELSE 'Leaf'
END
END

2018년 8월 15일 (수) 23:47 판

1 개요

HR-SQL Binary Tree Nodes
해커랭크 SQL
문제 DB2 MS SQL MySQL Oracle
HR-SQL Advanced Select e
HR-SQL Type of Triangle
HR-SQL The PADS
HR-SQL Occupations
HR-SQL Binary Tree Nodes
HR-SQL New Companies

2 DB2

3 MS SQL

4 MySQL

SELECT N, CASE
    WHEN P IS NULL THEN 'Root' 
    WHEN (SELECT COUNT(*) FROM BST WHERE P=A.N) = 0 THEN 'Leaf'
    ELSE 'Inner'
END
FROM BST A
ORDER BY N;
SELECT N, CASE
    WHEN P IS NULL THEN 'Root' 
    WHEN (SELECT COUNT(*) FROM BST WHERE P=A.N) > 0 THEN 'Inner'
    ELSE 'Leaf'
END
FROM BST A
ORDER BY N;

5 Oracle

문서 댓글 ({{ doc_comments.length }})
{{ comment.name }} {{ comment.created | snstime }}