Question
Inserting values 30, then 20, then 10 (in that order) into an initially empty AVL tree causes an imbalance at the root. Which rotation is needed to restore balance, and what becomes the new root?
More Data Structure Questions
- A directed graph has V vertices and E edges. Using adjacency lists, what is the time complexity of BFS when each vertex is enqueued at most once?
- Which SOLID principle ensures that a class has only one reason to change?
- In a Binary Search Tree, where is the smallest element always located?
- What is "unit testing" and how does it relate to debugging?
- Which of the following represents the Preorder Traversal of the binary tree given below? A / \ B C / \ D E
- What is the primary disadvantage of using a singly linked list compared to an array for random access (e.g., accessing the 50th element)?
- Which data structure is most suitable for efficiently implementing a priority queue, where the element with the highest (or lowest) priority must always be...
- Which graph traversal algorithm is most naturally suited to finding the shortest path between two nodes in an unweighted graph, and what underlying data st...
- What is the difference between 'BFS' (Breadth-First Search) and 'DFS' (Depth-First Search) in graph traversal?
- Fibonacci heaps support which operation in O(1) amortized time?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)