DSA Basic Quiz 29043

  1. Which data structure allows for constant-time insertion and deletion at both ends?
    a) Stack
    b) Queue
    c) Linked List
    d) Array

  2. What is the space complexity of a recursive function that calls itself multiple times?
    a) O(1)
    b) O(log n)
    c) O(n)
    d) O(n^2)

  3. Which data structure is used to implement a priority queue?
    a) Stack
    b) Queue
    c) Linked List
    d) Heap

1 Like

answers

  1. c
  2. c
  3. d