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