数据结构考研分类复习真题 第五章 答案[1]

第五章 数组和广义表答案

一选择题

B L J C I C B B A H C E A F B E A B B B B B A B B A C D C D F C D C A C A

二判断题

× √ √ × × × √ × × × × √ √ √

部分答案解释如下

错误对于完全二叉树用一维数组作存储结构是效率高的（存储密度大）

错误数组是具有相同性质的数据元素的集合数据元素不仅有值还有下标因此可以说数祖是元素值和下标构成的偶对的有穷集合

错误数组在维数和界偶确定后其元素个数已经确定不能进行插入和删除运算

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []