Inorder Sequence from BST

Given a binary search tree (BST), write a function that returns the in-order traversal sequence of the BST as a list of node values. The input is in level-order format. Print the in-order traversal as a list. Example Input: 1 2 3 null null null null Output: [2, 1, 3]

Key concepts

binary_search_treetraversal

Practise this out loud — free

Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.

🎙 Practise this question now

Part of Praxari's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.