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

Sort 1886 Discussions, By:

  • ashish98875
     + 0 comments
    SELECT N,
    CASE 
        WHEN P IS NULL THEN "Root"
        WHEN N IN (SELECT P FROM BST) THEN "Inner"
        ELSE "Leaf"
    END
FROM BST
ORDER BY N;

  • rh_pandit11
     + 0 comments

    /* Enter your query here. */ SELECT N, CASE WHEN P IS NULL THEN 'Root' WHEN N IN (SELECT P FROM BST) THEN 'Inner' ELSE 'Leaf' END FROM BST ORDER BY N;

  • ae20b031
     + 0 comments

    SELECT CASE WHEN P IS NULL THEN N WHEN N IN (SELECT DISTINCT P FROM BST) THEN N ELSE N END AS rn1, CASE WHEN P IS NULL THEN "Root" WHEN N IN (SELECT DISTINCT P FROM BST) THEN "Inner" ELSE "Leaf" END AS rn2 FROM BST ORDER BY rn1;

  • dwivedipriya2298
     + 0 comments

    select n, case when p is null then 'Root' else case when n in (select p from bst) then 'Inner' else 'Leaf' END end from bst order by n;

  • ehsan_haghighi
     + 0 comments

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

Load more conversations