608. Tree Node LeetCode Solution

In this guide, you will get 608. Tree Node LeetCode Solution with the best time and space complexity. The solution to Tree Node problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Tree Node solution in C++
Tree Node solution in Java
Tree Node solution in Python
Additional Resources

Problem Statement of Tree Node

Table: Tree

+————-+——+
| Column Name | Type |
+————-+——+
| id | int |
| p_id | int |
+————-+——+
id is the column with unique values for this table.
Each row of this table contains information about the id of a node and the id of its parent node in a tree.
The given structure is always a valid tree.

Each node in the tree can be one of three types:

“Leaf”: if the node is a leaf node.
“Root”: if the node is the root of the tree.
“Inner”: If the node is neither a leaf node nor a root node.

Write a solution to report the type of each node in the tree.
Return the result table in any order.
The result format is in the following example.

Example not found

Constraints not found

Complexity Analysis

Time Complexity: Google AdSense
Space Complexity: Google Analytics

608. Tree Node LeetCode Solution in C++

SELECT DISTINCT Parent.id,
  (
    CASE
      WHEN Parent.p_id IS NULL THEN 'Root'
      WHEN Parent.p_id IS NOT NULL AND Child.p_id IS NOT NULL THEN 'Inner'
      WHEN Parent.p_id IS NOT NULL AND Child.p_id IS NULL THEN 'Leaf'
    END
  ) AS type
FROM Tree AS Parent
LEFT JOIN Tree AS Child
  ON (Parent.id = Child.p_id);
/* code provided by PROGIEZ */