DBA2 [SQL] 해커랭크 HackerRank Binary Tree Nodes 문제 풀이 문제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 neither root nor leaf node. 해석주어진 테이블 BST는 이진 트리(Binary .. 2025. 3. 14. [SQL] 해커랭크 HackerRank 문제 풀이 Higher Than 75 Marks [SQL] hakerrank 문제 풀이문제Query the Name of any student in STUDENTS who scored higher than Marks. Order your output by the last three characters of each name. If two or more students both have names ending in the same last three characters (i.e.: Bobby, Robby, etc.), secondary sort them by ascending ID. 한국어 버전STUDENTS 테이블에서 75점보다 점수가 높은 학생의 Name 출력하라.각 이름의 마지막 3개 문자로 정렬하라.만약 마지막 3개 문자 이름이 같다면 ID를 .. 2025. 3. 8. 이전 1 다음
