morgenstanly 相关

上个月考了morgenstanly的笔试，今天赶紧记下来：

1， heep 和stack（堆和栈） 区别
In data structure, a heep is a priority queue that have the character of heep, let's take MAX HEEP for example, in Max Heep, Every parent node is bigger than his child node. So the root node is the biggest one, and everytime we could get the data in the root node.
A stack is a data structure that has character of LIFO(last input first output). For exmaple...

2，cluster-index 与 non-cluster-index 的区别
In cluster-index, it's index order is according to phisical storage order, in the leaf level, the node is the data, and it could be only on cluster index in any given table. And Non cluster index, it's order is not related to phisical order, in the leaf level , the node is still an index, it has a poiter pointing to the data.So it could have multiple non cluster index in a table

3,hashmap 的删除

4，c++改错题

5，