โ† Amazon questions

Search Element in Complete Sequential Binary Tree

Filed under Amazon

Given a complete binary tree where nodes are numbered 1 to N, determine if a target key exists in O(log N) time.

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 Amazon questions

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