2013半期考试-数据结构与算法.pptVIP

Mid-term Exam（周四上午） 1. (5分)什么是数据的逻辑结构？数据的逻辑结构可以分为哪几类？ 2. (5分)证明：在具有n(n=1)个结点的m叉树中，有n(m-1)+1个指针是空的。 3. (5分) In the linked list implementation, the current pointer points to the previous element of the logical current node, not point to the logical current node. Why? 4. (10分) Determine Θ for the following code fragments in the average case. (1) a=0; for(k=1; kn-1; k++) for(j=n; j=k; j--) a += k; (2) sum = 0; for (i=1; i=n; i++) for (j=1; j=n; j*=2) sum++; 5. (10分) Suppose you have a binary tree whose data fields are single chara