[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$foSKOX-6ZYzs2-mcaQjOx9tvQ9kL1LkNWu4sFQCL0eC0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2023-05-19 08:24:15",17650680,[8,9,10,11],"IO (sort(N))","O (sort(N))","IO(scan(N))","O(scan(N))",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},3,"83a018af0da8935baa37296d08474812","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2767552b8829d9c9937f13c5d4c0ce11.jpg","大数据算法","40b23f2e503e44bd8bab91f065a809c1","6.1","为数T的每个结点标上子树大小的I\u002FO复杂度为()",[21,26,31],{"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":30,"source":24,"type":25},[],17650681,[8,9,10,11],"前序计数的I\u002FO复杂度为()",{"answer":32,"createTime":5,"id":33,"options":34,"question":36,"source":24,"type":25},[],17650682,[9,11,35,10],"O(scan(N))IO","对给定顶点邻接链表T,其一个欧拉回路可以以()IO复杂性求得"]