数据结构期末试卷B7478（Data structure final exam B7478）.docVIP

数据结构期末试卷B7478（Data structure final exam B7478） 22. it is often more important to ask a question than to solve a problem - Einstein Data structure final exam B I. judgment questions: (10 points, 1 points per subject) 1, full two fork tree is also completely two fork tree () Ordered tree 2, two fork tree can be used less than 0 and less than or equal to 2 to represent () 3, in the K fork tree with only 0 degrees and K degrees, there are nodes N0,, K, and n0=nk+1, NK () 4. The shortest path of a vertex in a weighted connected graph to another vertex of a graph is not necessarily unique () 5, in the undirected graph of N nodes, if the number of edges is less than n-1, the graph must be a connected graph () 6, tree weighted path length of the smallest two fork tree, must have no degree of 1 node () 7, hash table lookup, without keyword comparison () 8, the binary search method can be used according to the value of a linear list ordered search () 9, for a heap by level traversal, not necessarily can get an ordered sequence () 10, since the last row in the Hill sorting process is the same as the direct insertion sorting process, the former must spend more time than the latter () Two, fill in the blanks: (20 points, 2 points per space) 1, degree 0 nodes, i.e. no node is called ________ node subtree Between the same node node node called ________ mutual son In 2, with n nodes of two binary list, there are _______ empty chain domain 3, an undirected graph with adjacency matrix storage method, the adjacency matrix is a ______________ 4, given the sequence {100, 86, 48, 73, 35, 39, 42, 57, 66, 21}, according to the definition of the reactor structure, then it is a pile of ______ 5, in the direct insertion sort, the initial data and compare the number of data is arranged ________; and in the direct selection sort, the initial data and compare the number of data is arranged __________ off 6, node keyword into the address of the node storage unit H function called _________ or ___