1、二叉树前、中、后、层序遍历递归与非递归实现;
https://blog.csdn.net/will130/article/details/51488142
2、图的深搜和广搜;
https://blog.csdn.net/u010006643/article/details/45673571
3、两个栈实现一个队列(考虑线程安全);
https://blog.csdn.net/hanjing_1995/article/details/51539578
4、B树与B+树的区别;
https://blog.csdn.net/random__walker/article/details/52051556
https://blog.csdn.net/yangshuangtao/article/details/48766831
5、红黑树的性质;
https://blog.csdn.net/Sun_TTTT/article/details/65445754
http://blog.chinaunix.net/uid-26548237-id-3480169.html
http://www.cnblogs.com/skywang12345/p/3245399.html
6、AVL树的单旋转;
https://blog.csdn.net/collonn/article/details/20128205
7、分别说一下7种内部排序;
https://blog.csdn.net/jia_xu_/article/details/78166127
8、有序表查找;
https://www.cnblogs.com/onepixel/articles/7674659.html
https://blog.csdn.net/sayhello_world/article/details/77200009
9、讲讲B+树,跟B树有什么区别
10、红黑树和avl树的区别,红黑树的定义,特点
11、map底层为什么用红黑树实现
12、介绍迭代器失效。push_back会导致迭代器失效吗
13、哈希冲突的解决方法