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