In which data structure is an AVL tree commonly used?
A. For managing dynamic arrays
B. For implementing priority queues
C. For maintaining balanced binary search trees
D. For implementing hash tables
Answer: Option C
A. For managing dynamic arrays
B. For implementing priority queues
C. For maintaining balanced binary search trees
D. For implementing hash tables
Answer: Option C
Which data structure is commonly used to implement a stack in function call management?
A. Stack
B. Queue
C. List
D. Tree
What data structure is most appropriate for implementing a scheduling system for processes?
A. Stack
B. Hash Table
C. Priority Queue
D. Binary Search Tree
Which data structure is used to implement a LRU (Least Recently Used) cache?
A. Linked List
B. Deque
C. Hash Table
D. Linked List
Join The Discussion