Question
What is the maximum possible number of nodes in a binary tree of height 4 (where the root is considered to be at height 0)?
More Data Structure Questions
- What is the output of the following recursive function call func(3) ? int func ( int n) { if (n == 0 ) return 1 ; return n * func(n -...
- How many edges does a complete undirected graph (K_n) containing 8 vertices contain, where every pair of distinct vertices is connected by exactly one edge...
- A hash table of size 7 uses the hash function h(k) = k mod 7, resolving collisions using linear probing. Keys are inserted in this order: 18, 25, 3, 10, 45...
- Which type of AI is primarily used for adaptive mobile applications like virtual assistants?
- Which feature of OOP allows hiding implementation details while showing only the necessary functionality?
- Which of the following is NOT among the OWASP Top 10 Web Security Risks?
- Quick Sort achieves its best-case time complexity of O(n log n) under which of the following pivot selection conditions?
- How many structurally distinct Binary Search Trees can be formed using exactly 4 distinct keys?
- What is the time complexity of inserting a new element at the beginning (head) of a singly linked list?
- Which of the following data structures is best suited for implementing a LIFO (Last In, First Out) mechanism?
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)