Binary Tree Nodes

  • + 0 comments

    et @root = 'Root'; set @inner = 'Inner'; set @leaf = 'Leaf';

    select n, CASE WHEN p is null then @root WHEN EXISTS (SELECT 1 FROM bst AS b2 WHERE b2.p = b1.n) THEN @inner ELSE @leaf END FROM bst AS b1 ORDER BY n;