Unique BST Paths

Given a binary search tree (BST), write a function that returns all unique paths from the root to leaf nodes. Each path is represented as a list of nodes. The input is specified in a level-order traversal format where 'null' represents a missing child node. Print the unique paths, one per line. Example Input: 1 2 3 null null null null Output: [1, 2] [1, 3]

Key concepts

binary_search_treerecursionpathfinding

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.