Leetcode Problem 1902. Depth of BST Given Insertion Order

1902. Depth of BST Given Insertion Order

Leetcode Solutions

Initialize a map to store intervals and their associated depths, starting with the interval [0, n+1] with a depth of 0.
Iterate over each value in the order array.
For each value, find the interval it belongs to using binary search.
Split the found interval into two new intervals at the inserted value.
Update the depths of the new intervals to be one greater than the depth of the original interval.
Continue the process for all values in the order array.
After all insertions, find the maximum depth stored in the map, which represents the depth of the binary search tree.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen