[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fJlyxlleARZYXGQXtFGh1CV9zFZxg8kXP1TotQ_6XsZM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-04-21 23:51:23",184030340,[8,9,10,11],"栈顶指针","栈底指针","栈的长度","系统内存",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},20,"4a0f045582f440bd8dc0382b21f08aef","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9676f9d56e11ad7df5bc8457ea68c639.png","数据结构","work_43033534","","链栈的最大容量通常取决于( )",[21,32,41,46,55,64,70,75,80,86],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],184030331,[25,26,27,28],"线性","非线性","树形","图形","栈是一种( )数据结构","v1",1,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],184030332,[36,37,38,39],"数组","链表","树","图","顺序栈的实现通常使用( )来存储栈中的元素",{"answer":42,"createTime":5,"id":43,"options":44,"question":45,"source":30,"type":31},[],184030333,[36,37,38,39],"链栈的实现通常使用( )来存储栈中的元素",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":30,"type":31},[],184030334,[50,51,52,53],"进栈","出栈","取栈顶元素","全部选项都对","栈的基本操作包括( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":63,"source":30,"type":31},[],184030335,[59,60,61,62],"先进后出","先出后进","先进先出","先出先进","栈的特点是( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":69,"source":30,"type":31},[],184030336,[50,51,52,68],"删除栈顶元素","顺序栈的插入操作称为( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":74,"source":30,"type":31},[],184030337,[50,51,52,68],"链栈的插入操作称为( )",{"answer":76,"createTime":5,"id":77,"options":78,"question":79,"source":30,"type":31},[],184030338,[50,51,52,68],"栈的出栈操作称为( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":85,"source":30,"type":31},[],184030339,[8,9,10,84],"栈的元素数量","顺序栈的最大容量通常由( )确定",{"answer":87,"createTime":5,"id":6,"options":88,"question":19,"source":30,"type":31},[],[8,9,10,11]]