Binary Search Tree Operations | Dataford Interview Questions

Can you write code to implement a binary search tree and discuss its operations?

Implement a BST supporting insertion, search, deletion, and inorder traversal. Duplicate values must not be inserted.

Contract

Define bst_operations(operations), where each operation is a dictionary with op equal to insert, search, delete, or inorder, and value required for every operation except inorder. Return one result per operation: true or false for mutations and searches, and a sorted list for traversals.

Constraints

1 <= operations.length <= 1000
Values are integers in the range [-10^9, 10^9]
Duplicate values must not be inserted
Each operation has op equal to insert, search, delete, or inorder
The value field is present for insert, search, and delete operations

Function Signature

def bst_operations(operations):

Your question is Binary Search Tree Operations. 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