← Oracle questions
CodingReported in a candidate post, May 2025

Self-balancing BST with rebalance on insert and delete

Filed under Oracle

Implement a self-balancing binary search tree that rebalances after every insertion and deletion, in the style of an AVL tree or a Red-Black tree. Support insert, delete and search in O(log n).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.