1Inserting at the end of a singly linked list with a tail pointer takes:AO(log n)BO(n log n)CO(1)DO(n)View AnswerDiscussWorkspaceReportSaveEasy
2Each node of a singly linked list contains:AData and a pointer to the next nodeBAn indexCData onlyDTwo pointers onlyView AnswerDiscussWorkspaceReportSaveEasy
3Reversing a singly linked list in place takes:AO(n) time and O(1) extra spaceBO(log n) timeCO(n) extra space alwaysDO(n²) timeView AnswerDiscussWorkspaceReportSaveEasy
4Inserting a node at the head of a singly linked list takes:AO(n)BO(n²)CO(1)DO(log n)View AnswerDiscussWorkspaceReportSaveEasy
5An XOR linked list stores in each node:ATwo full pointersBNo pointersCThe XOR of the previous and next addressesDA hash valueView AnswerDiscussWorkspaceReportSaveEasy