Quick Overview

Find binary-tree depth from a portable child-index representation, including empty trees and highly unbalanced root-to-leaf paths.

Find the Maximum Depth of a Binary Tree

Company: LinkedIn

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Find binary-tree depth from a portable child-index representation, including empty trees and highly unbalanced root-to-leaf paths.

Read the full LinkedIn Software Engineer interview experience this question came from

Loading…