Compute Binary Tree Height

Given the root of a binary tree, return its height. Height is the number of nodes on the longest path from the root to any leaf, and an empty tree has height 0.

Inputroot = [1, 2, 3, 4, 5]Output3WhyThe longest root-to-leaf path contains 3 nodes.

Inputroot = []Output0WhyAn empty tree has height 0.

Problem

Given the root of a binary tree, return its height. Height is the number of nodes on the longest path from the root to any leaf, and an empty tree has height 0.

Examples

Example 1

Inputroot = [1, 2, 3, 4, 5]Output3WhyThe longest root-to-leaf path contains 3 nodes.

Example 2

Inputroot = []Output0WhyAn empty tree has height 0.

Constraints

`0 <= number of nodes <= 10^4`
`-10^9 <= Node.val <= 10^9`
The input tree is a valid binary tree

Problem

Given the root of a binary tree, return its height. Height is the number of nodes on the longest path from the root to any leaf, and an empty tree has height 0.

Examples

Example 1

Inputroot = [1, 2, 3, 4, 5]Output3WhyThe longest root-to-leaf path contains 3 nodes.

Example 2

Inputroot = []Output0WhyAn empty tree has height 0.

Constraints

`0 <= number of nodes <= 10^4`
`-10^9 <= Node.val <= 10^9`
The input tree is a valid binary tree

Problem

Given the root of a binary tree, return its height. Height is the number of nodes on the longest path from the root to any leaf, and an empty tree has height 0.

Examples

Example 1

Inputroot = [1, 2, 3, 4, 5]Output3WhyThe longest root-to-leaf path contains 3 nodes.

Example 2

Inputroot = []Output0WhyAn empty tree has height 0.

Constraints

`0 <= number of nodes <= 10^4`
`-10^9 <= Node.val <= 10^9`
The input tree is a valid binary tree

Interview Guides

Problem

Examples

Constraints

Problem

Examples

Constraints

Compute Binary Tree Height

Problem

Examples

Constraints

Problem

Examples

Constraints