[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fzhpXbpduYq1vCKJup_mnU5hhlP4qBdkejPC9XV8_mfM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":26,"type":27},[],"2023-12-28 01:57:04",979843005,[8,9,10,11],"6,8,10,11","6,9,10,11","6,7,9,11","6,8,9,11",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F61e7258baee8062dca368196e2be2a47.jpg","数据结构与算法","在有11个元素的有序表A[ 1,2,...,11]中进行折半查找查找元素A[11]时,被比较的元素下标依次是( )",[17,28,37,45,50,55,58,67,76,85],{"answer":18,"createTime":5,"id":19,"options":20,"question":25,"source":26,"type":27},[],979841382,[21,22,23,24],"top->next=x","x->next=top->next; top- >next=x","x->next=top; top=x","x->next-top; top=top->nex;t","向一个栈顶指针为top的链栈中插入一个x结点,则执行( )","v2",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],979841431,[32,33,34,35],"SXSXSSXX","SSSXXSXX","SXSSXXSX","SXSSXSXX","用S表示进栈操作,用X表示出栈操作,若元素的进栈顺序是1234, 为了得到1342的出栈顺序,相应的和X的操作序列为( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":43,"source":26,"type":44},[],979841877,[41,42],"对","错","若有一个叶子结点是二叉树中某个子树的中序遍历结果序列的最后一个结点,则它一定是该子树的前序遍历结果序列的最后一个结点( )",3,{"answer":46,"createTime":5,"id":47,"options":48,"question":49,"source":26,"type":44},[],979842295,[41,42],"无向图的邻接矩阵一定是对称矩阵,有向图的邻接矩阵一定是非对称矩阵.( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":54,"source":26,"type":44},[],979842321,[41,42],"若散列表的装填因子α<1,则可避免碰撞的产生.( )",{"answer":56,"createTime":5,"id":6,"options":57,"question":15,"source":26,"type":27},[],[8,9,10,11],{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":26,"type":27},[],979843068,[62,63,64,65],"n-1","n","2n-1","2n","在有n个叶子结点的哈夫曼树中,非叶子结点的总数是( )",{"answer":68,"createTime":5,"id":69,"options":70,"question":75,"source":26,"type":27},[],979843123,[71,72,73,74],"01,0000,0001,001,1","011,000,001,010,1","000,001,010,011,100","0,100,110,1110,1100","5个字符有如下4种编码方案,不是前缀编码的是( )",{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":26,"type":27},[],979843212,[80,81,82,83],"4","5","6","7","含有20个结点的平衡二叉树的最大深度为( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":26,"type":27},[],979843361,[89,90,91,92],"数据元素过多","负载因子过大","散列函数选择不当","解决冲突的方法选择不当","采用开放定址法解决冲突的散列查找中,发生聚集的原因主要是( )"]