2013年4月测验数据结构第三次功课(国外英文资料).docVIP

2013年4月考试数据结构第三次作业(国外英文资料) In April 2013, the third assignment of the data structure A: one, fill in the blanks. The basic components of the binary tree are root (N), left subtree (L) and right subtree (R). So there are six different sequences of the binary tree. Method is the most commonly used three kinds: former sequence (i.e., according to the N L R order), after the sequence method (i.e., in order...) and the sequence method (also known as symmetry sequence method, namely the press L N R order). These three methods are related to each other. If a binary tree is known as a BEFCGDH, the sequence in the middle sequence is FEBGCHD, and its postsequence must be ______. Suppose you have a 2-d array A6 by 8, each of which is stored in contiguous 6 bytes, and the memory is addressed in bytes. The initial storage location of A (base address) is known as 1000, and the volume of an array A is ______. The first byte address of the end element A57 is... When the row is stored, the first byte address of the element A14 is ______; When the column is stored, the first byte address of the element A47 is ______. The time complexity of an algorithm is (3n2 + 2nlog2n + 4n-7)/(5n), the order of magnitude is _____. In a tree, ____nodes have no successor. Two, the program read the problem (20 points in the big question, a total of 2 little questions, 10 points per little question) 1. Prioritize, a group of 49,7,50,5,94,16,90,29,71 key son write separately in the following sort sorting method, each at the end of the trip to sort the sequence of these keywords. 1) simple insertion sort 2) hill sort (d1 = 4, d2 = 2, d3 = 1) What is the function of the following algorithm? LinkList L {/ / L is a single linked list of headless nodes. If (L l - next) {Q = L; L = L - next; P = L; While (p- next) P = p- next; P - next = Q; Q - next = NULL; } return L; } / / Demo Short answer (30 points in this big question, 2 small questions, 15 points for each question) The lookup of the index order ta