We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
My submission in Oracle. Using the exists clause would prove to be more efficient
SELECT N
,(CASE
WHEN P IS NULL THEN 'Root'
WHEN EXISTS (SELECT P FROM BST B WHERE A.N=B.P) THEN 'Inner'
ELSE 'Leaf'
END)
FROM BST A ORDER BY N;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Tree Nodes
You are viewing a single comment's thread. Return to all comments →
My submission in Oracle. Using the exists clause would prove to be more efficient SELECT N ,(CASE WHEN P IS NULL THEN 'Root' WHEN EXISTS (SELECT P FROM BST B WHERE A.N=B.P) THEN 'Inner' ELSE 'Leaf' END) FROM BST A ORDER BY N;