Support randomized insertion into the BST
sambitdash opened this issue · comments
Simple sequential BST can be O(n) on search. However, randomizing it can improve the amortized time complexity.
https://algs4.cs.princeton.edu/home/ may have a suggested implementation for it.