1 votes 1 votes The efficient data structure to insert/delete a number in a stored set of number is Queue Linked list Doubly linked list Binary tree DS ugcnetsep2013ii data-structures queue linked-list + – go_editor asked Jul 20, 2016 recategorized May 24, 2020 go_editor 4.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes clearly doubly linked list C) as it can do it fastest than rest Sanjay Sharma answered Jul 20, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes I think Doubly linked list Reason: only the node to be inserted/deleted needs to be manipulated and no traversals in forward or backward direction required for the operation so it is more efficient. :) sh!va answered Jul 20, 2016 sh!va comment Share Follow See 1 comment See all 1 1 comment reply vijaycs commented Jul 20, 2016 reply Follow Share only the node to be inserted/deleted needs to be manipulated and no traversals in forward or backward direction required for the operation. According to you ... DLL takes O(1) time right ?? consider a sorted array A[] = { 1, 3, 5, 7, 9, 10, 20}. And we want to insert 6 or we want to delete 9 from the sorted list ... How much time it will take by double LL .. ?? And if option D had been Binary Search tree instead of binary tree then ?? 0 votes 0 votes Please log in or register to add a comment.