6How do you find the middle of a linked list in one pass?AUse a slow pointer and a fast pointerBUse binary searchCCount nodes twiceDSort it firstView AnswerDiscussWorkspaceReportSaveEasy
7A skip list adds:AArray indexingBExtra levels of forward pointers for faster searchCA hash tableDBackward pointersView AnswerDiscussWorkspaceReportSaveEasy
8Each node of a doubly linked list contains:AData onlyBTwo data fieldsCA next pointer onlyDData, a next pointer and a previous pointerView AnswerDiscussWorkspaceReportSaveEasy
9Which is a disadvantage of linked lists compared with arrays?AThey cannot store integersBFixed sizeCNo random access and extra memory for pointersDCostly insertion at the headView AnswerDiscussWorkspaceReportSaveEasy
10Inserting at the end of a singly linked list with a tail pointer takes:AO(n)BO(log n)CO(1)DO(n log n)View AnswerDiscussWorkspaceReportSaveEasy