What are the disadvantages of representing a stack or queue by a linked list?
- 1 Answers
- 1020 Views
- I also Faced
- E-Mail Answers
Answer Posted / Chandra Mohan
1. Inefficient access time: Since elements in a linked list are accessed by traversing through the pointers, accessing an element at an arbitrary position can be slow compared to arrays.
2. Insertion and deletion operations are slower due to the need to update pointer references.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What sort of serious problems have you experienced, and how have you handled them?
Write a program for Sorting an Array. Which sorting will you prefer?
Can you declare an array without assigning the size of an array?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
