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
case when P is null then N || ' Root'
when N not in (select distinct P from BST) then N || ' Leaf'
else N || ' Inner'
end case
from BST order by N;
Could anyone explain why this gives wrong output?
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 →
select case when P is null then N || ' Root' when N not in (select distinct P from BST) then N || ' Leaf' else N || ' Inner' end case from BST order by N;
Could anyone explain why this gives wrong output?