CodingMediumcod-g773

Subject Binary search treeLevel Entry–Mid~16 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a binary tree as a level-order array (null for missing), determine whether it is a valid binary search tree: every node's value is strictly greater than all values in its left subtree and strictly less than all values in its right subtree. Duplicate values make it invalid. Return true or false.

Implement

is_valid_bst(level: list) → bool

Examples

in[[2,1,3]]outtrue

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.