Question
What is the maximum possible number of nodes in a binary tree of height 3 (where the root is considered to be at height 0)?
More Data Structure Questions
- Which of the following integrity constraints ensures that every non-null foreign key value must reference an existing primary key value in another table?
- In an AVL tree, after inserting a new node, node X becomes unbalanced with a balance factor of +2 (right subtree taller), and X's right child also has a ba...
- Binary search on a sorted array of n distinct elements has what worst-case asymptotic comparison complexity?
- Which traversal of a Binary Search Tree (BST) visits the nodes in strictly ascending sorted order of their key values?
- What is the minimum number of comparisons that any comparison-based sorting algorithm needs in the worst case to sort 5 distinct elements?
- How many distinct spanning trees does the complete labelled graph K5 have?
- Which CPU scheduling algorithm always selects the process with the smallest burst time first, potentially leading to starvation?
- Binary Search on a sorted array satisfies the recurrence relation T(n) = T(n/2) + O(1). What is the resulting worst-case time complexity of Binary Search?
- 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...
- Merge Sort on an array of size n satisfies the recurrence relation T(n) = 2T(n/2) + O(n). What is the resulting worst-case time complexity of Merge Sort?
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)