[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fdlE1uzKefozUnPJMQrdVtR_CYYr3MOwZzTvD6RtHuHQ":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",184030333,[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,37,40,49,58,64,69,74,83],{"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":36,"source":30,"type":31},[],184030332,[8,9,10,11],"顺序栈的实现通常使用( )来存储栈中的元素",{"answer":38,"createTime":5,"id":6,"options":39,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":30,"type":31},[],184030334,[44,45,46,47],"进栈","出栈","取栈顶元素","全部选项都对","栈的基本操作包括( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":30,"type":31},[],184030335,[53,54,55,56],"先进后出","先出后进","先进先出","先出先进","栈的特点是( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":63,"source":30,"type":31},[],184030336,[44,45,46,62],"删除栈顶元素","顺序栈的插入操作称为( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":30,"type":31},[],184030337,[44,45,46,62],"链栈的插入操作称为( )",{"answer":70,"createTime":5,"id":71,"options":72,"question":73,"source":30,"type":31},[],184030338,[44,45,46,62],"栈的出栈操作称为( )",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":30,"type":31},[],184030339,[78,79,80,81],"栈顶指针","栈底指针","栈的长度","栈的元素数量","顺序栈的最大容量通常由( )确定",{"answer":84,"createTime":5,"id":85,"options":86,"question":88,"source":30,"type":31},[],184030340,[78,79,80,87],"系统内存","链栈的最大容量通常取决于( )"]