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 distinct b1.N,
case when b2.N is null AND b1.P is not null then 'Leaf'
when b2.N is not null and b1.P is not null then 'Inner'
when b1.P is null then 'Root' end as quoted
from BST b1 left join BST b2
on b1.N = b2.P
order by 1;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Binary Tree Nodes
You are viewing a single comment's thread. Return to all comments →
select distinct b1.N, case when b2.N is null AND b1.P is not null then 'Leaf' when b2.N is not null and b1.P is not null then 'Inner' when b1.P is null then 'Root' end as quoted
from BST b1 left join BST b2 on b1.N = b2.P order by 1;