← Microsoft questions

Identify Leaves of BST through Pre-Order without construction

Filed under Microsoft

Identify the leaf nodes of a Binary Search Tree (BST) given only its pre-order traversal array. You must solve this without explicitly constructing the tree structure.

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

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