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.
  1. Prepare
  2. SQL
  3. Advanced Select
  4. Binary Tree Nodes
  5. Discussions

Binary Tree Nodes

  • ThiagoTVarella
     + 0 comments

    This solution may be more performant for very large tables as it doesn't require the creation of a whole new DISTINCT set

    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