Balanced trees are wildly used but rarely asked during the job interview due to the complexity to implement them.
However we still need to have a basic understanding of them.
Interval trees and segment trees are two popular but not-so-popular data structure and they may be asked during job interview.
The key difference between interval trees and segments is the first one faces intervals while the second one deals with points.
I once thought questions like 'which part is the const variables stored in memory' was not good because we could quickly search the manual when necessary, however they are asked during the job interview, and asked twice!
So, let's just take a brief look at the frequent asked C++ interview …
I was once asked the question how to optimize a linked list?
Well, I'm not sure...
So long as the linked list is somehow a linear data structure, we can only visit the previous elements to get the successive elements.
I would try to build a BST instead, or maintain …
As I plan to graduate and get a master degree in computer science in December 2015, the summer of 2015 is an excellent time to prepare for the job interview.
My plan is very simple, just to review the Cracking the Coding Interview (or CC 150) and finish the problems …