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.
select N,
case when P is null then 'Root' else
(case when (select COUNT(*) FROM BST WHERE P=B.N)>0 then 'Inner' else 'Leaf' end) end as Node
from BST B
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 →
Universal version working in all databases:
select N, case when P is null then 'Root' else (case when (select COUNT(*) FROM BST WHERE P=B.N)>0 then 'Inner' else 'Leaf' end) end as Node from BST B order by N;