HackerRank MySQL - Binary Tree Nodes
You are given a table, BST, containing two columns: N and P, where N represents the value of a node in Binary Tree, and P is the parent of N.
WHEN P IS NULL THEN 'Root'
WHEN N IN (SELECT P FROM BST) THEN 'Inner'
ORDER BY N;
Please click on the like button if it worked
Solution not working or have any suggestions? Please send an email to [email protected]
donate a cup of tea :)
Join Our Facebook Group
Popular HackerRank Mysql Solutions
Codesadda.com is your home of programming solutions, tutorials, video tutorials and much more.
Sign Up for our weekly newsletter to get update about new content.