BST k-th smallest
Process a stream of commands on an initially empty binary search tree. ["insert", v] inserts v (duplicates allowed and go to the right subtree). ["kth", k] returns the k-th smallest value currently in the tree (1-indexed), or -1 if the tree has fewer than k elements. Return the list of answers to the "kth" commands, in order. Build the BST in insertion order without rebalancing.
Implement
bst_order_statistics(commands: list[list]) → list[int]Examples
in
[[["insert",5],["insert",3],["insert",8],["kth",1],["kth",2],["kth",3]]]out[3,5,8]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.
0:00 of about 35 min
solution.py
InputExpectedGot
[[["insert",5],["insert",3],["insert",8],["kth",1],["kth",2],["kth",3]]][3,5,8]not run yetsample