They asked me to implement a balanced binary search tree from scratch and explain its time complexity. They also wanted me to optimize it for handling duplicate values
Anonymous
I started by explaining the basic structure and properties of a binary search tree. However, I struggled with the balancing algorithm details and couldn't fully implement the rotation logic needed to maintain balance. I wish I had reviewed AVL and Red-Black tree implementations beforehand.
Check out your Company Bowl for anonymous work chats.