[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fSvzx27uu6pz9j1ZiueAQGF9MvdqoZEAR4lHMTnS2YB0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-07 19:06:07",35401187,[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","第二章单元测试","栈操作数据的原则是( )",[20,31,41,49,54,59,64,69,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":33,"options":34,"question":39,"source":29,"type":40},[],35401073,[35,36,37,38],"数据域","头指针","尾指针","指针域","和链栈类似,用单链表来实现链队.根据队的先入先出(FIFO)原则,为了操作上的方便,使用一个( )和( )",1,{"answer":42,"createTime":5,"id":43,"options":44,"question":47,"source":29,"type":48},[],35401081,[45,46],"对","错","在初始化空顺序栈时一般不限定栈的最大容量,因为,栈在使用过程中所需最大空间的大小很难估计",3,{"answer":50,"createTime":5,"id":51,"options":52,"question":53,"source":29,"type":48},[],35401089,[45,46],"栈和队列不能进行再分配了",{"answer":55,"createTime":5,"id":56,"options":57,"question":58,"source":29,"type":48},[],35401101,[45,46],"构造一个空栈S 时,不需要用动态存储空间分配函数",{"answer":60,"createTime":5,"id":61,"options":62,"question":63,"source":29,"type":48},[],35401172,[45,46],"栈与队列是一种特殊操作的线性表( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":29,"type":48},[],35401180,[45,46],"队列允许在表的一端进行插入操作和删除操作",{"answer":70,"createTime":5,"id":6,"options":71,"question":18,"source":29,"type":30},[],[8,9,10,11],{"answer":73,"createTime":5,"id":74,"options":75,"question":76,"source":29,"type":48},[],35401211,[45,46],"入栈需要修改地址指针",{"answer":78,"createTime":5,"id":79,"options":80,"question":81,"source":29,"type":48},[],35401221,[45,46],"链栈主要的运算,如插入、删除是在栈顶执行的. 链表的头部作栈顶是最方便的,需要像单链表那样为了运算方便附加一个头结点"]