[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fGcgL7ZEve-QfRQw4uzAJrJS3cgySOf6_w2J8EAIq5kU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":27,"type":44},[],"2023-05-07 19:06:07",35401180,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000007694","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F08370ed09f46aa51ac059eff9bacbea6.jpg","算法与数据结构（山东联盟）","16351281","第二章单元测试","队列允许在表的一端进行插入操作和删除操作",[18,29,39,45,50,55,60,63,72,77],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],35401044,[22,23,24,25],"一维数组实现","二维数组实现","结构体","枚举型","队列的顺序存储结构用C语言中( )数据类型实现","v2",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":38},[],35401073,[33,34,35,36],"数据域","头指针","尾指针","指针域","和链栈类似,用单链表来实现链队.根据队的先入先出(FIFO)原则,为了操作上的方便,使用一个( )和( )",1,{"answer":40,"createTime":5,"id":41,"options":42,"question":43,"source":27,"type":44},[],35401081,[8,9],"在初始化空顺序栈时一般不限定栈的最大容量,因为,栈在使用过程中所需最大空间的大小很难估计",3,{"answer":46,"createTime":5,"id":47,"options":48,"question":49,"source":27,"type":44},[],35401089,[8,9],"栈和队列不能进行再分配了",{"answer":51,"createTime":5,"id":52,"options":53,"question":54,"source":27,"type":44},[],35401101,[8,9],"构造一个空栈S 时,不需要用动态存储空间分配函数",{"answer":56,"createTime":5,"id":57,"options":58,"question":59,"source":27,"type":44},[],35401172,[8,9],"栈与队列是一种特殊操作的线性表( )",{"answer":61,"createTime":5,"id":6,"options":62,"question":16,"source":27,"type":44},[],[8,9],{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":27,"type":28},[],35401187,[67,68,69,70],"后进先出","先进先出","后进后出","不分顺序","栈操作数据的原则是( )",{"answer":73,"createTime":5,"id":74,"options":75,"question":76,"source":27,"type":44},[],35401211,[8,9],"入栈需要修改地址指针",{"answer":78,"createTime":5,"id":79,"options":80,"question":81,"source":27,"type":44},[],35401221,[8,9],"链栈主要的运算,如插入、删除是在栈顶执行的. 链表的头部作栈顶是最方便的,需要像单链表那样为了运算方便附加一个头结点"]