Find Element in Special Binary Tree
Filed under Zeotap
The question
Find a given element in a binary tree where the root of every subtree is its smallest element and all elements in the left subtree are smaller than those in the right subtree, optimized to O(log n).
No write-up yet. Related questions below have one.
Related Zeotap questions
Collected from public candidate posts and coding forums. Updated Nov 2026.