โ† Maersk questions
CodingReported in a candidate post, Nov 2025

Height and element lookup in a complete binary tree in O(log n), coded in Go

Filed under Maersk

The question

Given a complete binary tree with nodes numbered 1, 2, 3, ..., find its height and locate a particular element, each in O(log n), and write working code in Go.

No write-up yet. Related questions below have one.

Related Maersk questions

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