[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fWD_Q2dy5eX4Yn1DawOtMDZDOnxri1CGYcsSMlIWQijk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2023-12-25 16:00:49",121309193,[8,9,10,11],"64 19 21","64 21","56 21","56 19 21",{"courseId":13,"courseImg":14,"courseName":15},"bdd665767202adf2f9e7a16501f8d82a","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","数据结构","折半查找有序表(5,13,19,21,37,56,64,75,80,88,92).若查找表中元素21,则它将依次与表中( )比较大小后查找成功",[18,30,39,48,57,66,75,84,93,102],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2023-12-25 16:00:48",121309156,[23,24,25,26],"return stack.top.data","return stack.top","return stack.(top--).data","return stack.( --top).data","有一链表实现的栈stack,栈顶结点指针为top,结点数据为data,要出栈并获取出栈元素的数据,正确的语句为( )","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],121309159,[34,35,36,37],"7,8","6,7","6,8","11,12","某完全二叉树有13个结点,按0~12依次编号,则结点3的左、右孩子编号分别是( )",{"answer":40,"createTime":20,"id":41,"options":42,"question":47,"source":28,"type":29},[],121309163,[43,44,45,46],"325*4\u002F-52*+","325*4\u002F52-*+","325+*4\u002F52-*","325*4\u002F52*-+","计算机表达式求值过程,一般将中缀表达式转换为后缀表达式,中缀表达式"3+2*5\u002F4*(5-2)"对应的后缀表达式为( )",{"answer":49,"createTime":20,"id":50,"options":51,"question":56,"source":28,"type":29},[],121309168,[52,53,54,55],"排序算法不稳定","目前已经算法中空间复杂度最低","算法复杂度为O(n^2)","属于选择类排序","下列关于快速排序,说法正确的是( )",{"answer":58,"createTime":20,"id":59,"options":60,"question":65,"source":28,"type":29},[],121309177,[61,62,63,64],"31","63","64","32","深度为6的二叉树最多有( )个结点",{"answer":67,"createTime":20,"id":68,"options":69,"question":74,"source":28,"type":29},[],121309179,[70,71,72,73],"BACD","CBAD","DCBA","CDAB","按ABCD的顺序入栈,则下列不可能出现的出站顺序为( )",{"answer":76,"createTime":20,"id":77,"options":78,"question":83,"source":28,"type":29},[],121309181,[79,80,81,82],"p.next=s.next; p.next=s","s.next=p.next; p.next=s","p.next=s; p.next=s.next","p.next=s; s.next = p.next","在单链表结点p之后插入结点s,正确的操作是( )",{"answer":85,"createTime":20,"id":86,"options":87,"question":92,"source":28,"type":29},[],121309184,[88,89,90,91],"15 2 21 23 44","2 15 21 23 44","15 21 2 23 44","2 21 2 23 44","使用冒泡法对数组{15,23,21,2,44}按从小到大的顺序排序,第一轮排序完成后,该数组的顺序为( )",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":28,"type":29},[],121309188,[97,98,99,100],"9","11","15","14","若一颗二叉树具有10个度为2的结点,5个度为1的结点,则度为0的结点个数是( )",{"answer":103,"createTime":5,"id":6,"options":104,"question":16,"source":28,"type":29},[],[8,9,10,11]]