← Arcesium questions

Convert BST complete binary tree to min-heap in O(n)

Filed under Arcesium

Given a Binary Search Tree (BST) that is also a complete binary tree, convert it into a min-heap in O(n) time complexity without creating extra nodes, by modifying node values directly.

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

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