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

  • abk22092008
     + 0 comments

    MySQL Solution

    Logic:

    1. If the parent node corresponding to a node is 'NULL' -> It is the root node.
    2. Else if the node is a part of the parent as well as the node columns, it means that the node has a child as well as a parent. So -> this is an inner node.
    3. Else all other nodes will be the leaf nodes because they have a parent node but no child nodes.

    Code:

    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;