McqMate

Q. |
## Worst space complexity of stack data structure is |

A. | o(log(n)) |

B. | o(1) |

C. | n/a |

D. | o(n) |

Answer» D. o(n) |

688

0

Do you find this helpful?

3

View all MCQs in

Data Structures (DS)No comments yet

- Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
- Worst space complexity of queue data structure is
- When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
- Pushing an element into stack already having five elements and stack size of 5, then stack becomes
- Worst space complexity of singly linked list is
- What is the worst case time complexity of inserting a node in a doubly linked list?
- The worst case complexity of deleting any arbitrary node value element from heap is
- What is the best case and worst case complexity of ordered linear search?
- What is the worst case complexity of binary search using recursion?
- What is the worst case complexity of bubble sort?