Binary Tree Nodes

Sort by

recency

|

2467 Discussions

|

  • + 0 comments

    SELECT N, CASE WHEN p IS NULL then 'Root' WHEN N IN (SELECT p FROM BST WHERE p IS NOT NULL) THEN 'Inner' else 'Leaf' end FROM BST order by N

  • + 0 comments

    **SELECT N, CASE WHEN P IS NULL THEN 'Root' WHEN N NOT IN (SELECT P FROM BST WHERE P IS NOT NULL) THEN 'Leaf' ELSE 'Inner' END FROM BST ORDER BY N ; **

  • + 0 comments

    SELECT N, CASE WHEN P IS NULL THEN 'Root' WHEN N NOT IN (SELECT P FROM BST WHERE P IS NOT NULL) THEN 'Leaf' ELSE 'Inner' END FROM BST ORDER BY N ;

  • + 0 comments

    select N , IF(p is NULL, 'Root', IF(N in (select p from BST where p is not NUll), 'Inner','Leaf'))

    from BST order by N;

  • + 0 comments
    SELECT N,
     CASE 
      WHEN p IS NULL then 'Root'
      WHEN N NOT IN (SELECT p FROM BST WHERE p IS NOT NULL) THEN 'Leaf' 
      else 'Inner'
     end
    FROM BST 
    order by N