Height of a Binary Tree

Easy

The height of a binary tree is the maximum number of edges between the root and its leaf nodes.

Given a binary tree root, calculate the height of the tree.

For example, let's say you're given the following binary tree:

The height is 2 since leaf nodes -4, 7, and 8 are 2 edges away from the root.

Try it

class BinaryTreeNode:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

def tree_height(tree: BinaryTreeNode) -> int:
    # implement tree_height
    return 0

1class BinaryTreeNode:
2    def __init__(self, data):
3        self.data = data
4        self.left = None
5        self.right = None
6
7def tree_height(tree: BinaryTreeNode) -> int:
8    # implement tree_height
9    return 0
10

Solution

9 Essential Trees & Graphs Coding Interview Problems

Master Trees & Graphs by trying the coding challenges below.

1.Inorder TraversalEasy
2.Tree SumEasy
3.Tree HeightEasy
4.LCAMedium
5.Max Path SumHard
6.Search mazeMedium
7.Number of islandsMedium
8.Kth SmallestMedium
9.Sort K ArraysHard

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.