Question

If elements are inserted into a Binary Search Tree in strictly ascending order (e.g., 1, 2, 3, 4, 5), what will be the resulting structure of the tree?

A A perfectly balanced tree.
B A complete binary tree.
C A skewed tree resembling a linked list.
D A full binary tree.
E An AVL tree.
Practice Next

Hey! Ask a query

🎓
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)