[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fnz-AOs0fvVtt7bJ7HV9Png5lFks6kOp5nxUtyhnJUyk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":27,"type":28},[],"2024-03-30 16:01:23",136273870,[8,9,10,11],"L=NULL","L->next==NULL","L->next==L","L!=NULL",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},6,"d9139572bd8e9b466b5947011e5c5c3f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9f919e91c3941b64f778d058a7fcb4c7.jpg","数据结构（C语言）","30e2391aad0e4a5daadb52fad821f49e","2.3 线性链表--课堂测验","带头节点的单链表L为空的判定条件是__________",[21,29,38,47,54,63],{"answer":22,"createTime":23,"id":24,"options":25,"question":19,"source":27,"type":28},[],"2023-12-18 21:50:44",115630118,[8,26,10,11],"L->next=NULL","v1",0,{"answer":30,"createTime":23,"id":31,"options":32,"question":37,"source":27,"type":28},[],115630119,[33,34,35,36],"O\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8f8a94ea0468e663d4bc29f4ac6bfc70.png\">)","O(1)","O(n2)","O(n)","对于一个具有n个元素的线性表,建立其单链表的时间复杂度为__________",{"answer":39,"createTime":23,"id":40,"options":41,"question":46,"source":27,"type":28},[],115630122,[42,43,44,45],"节点除自身信息外还包括指针域,因此存储密度小于顺序存储结构","逻辑上相邻的元素物理上不必相邻","可以通过头节点直接计算第i个节点的存储地址","插入、删除运算操作方便,不必移动节点","以下关于单链表的叙述中,不正确的是__________",{"answer":48,"createTime":23,"id":49,"options":50,"question":53,"source":27,"type":28},[],115630125,[34,36,51,52],"O(m)","O(m+n)","将长度为n的单链表链接在长度为m的单链表之后的算法时间复杂度是__________",{"answer":55,"createTime":23,"id":56,"options":57,"question":62,"source":27,"type":28},[],115630126,[58,59,60,61],"使单链表至少有一个节点","标识链表中重要节点的位置","方便运算的实现","说明单链表是线性表的链式存储结构","在单链表中,增加一个头节点的目的是为了__________",{"answer":64,"createTime":5,"id":6,"options":65,"question":19,"source":27,"type":28},[],[8,9,10,11]]