Leetcode Problem 366. Find Leaves of Binary Tree

366. Find Leaves of Binary Tree

Leetcode Solutions

Define a recursive function getHeight(node) that returns the height of the given node.
If the node is null, return -1.
Calculate the height of the left and right children recursively.
The height of the current node is 1 plus the maximum height of its children.
Add the current node's value to the list corresponding to its height in the output list of lists.
If the list for the current height does not exist, create it.
Return the height of the current node.
Call getHeight(root) to initiate the process.
Return the output list of lists.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen