Implement a Binary Tree | Dataford Interview Questions

Solve a problem involving data structures, such as implementing a binary tree. Implement build_bst(values), inserting values in order into a binary search tree. Ignore duplicate values and return the tree as nested arrays in the form [value, left, right], using None for missing children and [] for an empty tree.

Input and Output

values is a list of integers. Return the nested array representation of the resulting binary search tree.

Constraints

0 <= len(values) <= 1,000
-10^9 <= values[i] <= 10^9
Duplicate values must be ignored
The output uses [value, left, right] and None for missing children

Function Signature

def build_bst(values):

Your question is Implement a Binary Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Input and Output

values is a list of integers. Return the nested array representation of the resulting binary search tree.

Constraints

0 <= len(values) <= 1,000
-10^9 <= values[i] <= 10^9
Duplicate values must be ignored
The output uses [value, left, right] and None for missing children

Function Signature

def build_bst(values):

Your question is Implement a Binary Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.