โ† FactSet questions

Height of Binary Tree without recursion

Filed under FactSet

Given the root of a binary tree, write an iterative algorithm to find its height (maximum depth) without using recursion.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related FactSet questions

Collected from public candidate posts and coding forums. Updated Nov 2026.