The Order Inspector
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L4
Interview Prompt
Given a tree stored as a dict where each node name maps to {'val', 'left', 'right'} (left/right point to another node name or None) and a root node name, return True if the tree is a valid BST (strictly, no duplicates: left subtree < node < right subtree).
Summary
A binary tree has rules - is this one actually following them?
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision