Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Data Structures
/
Exercises
/
Exercise 7
Data Structures
hard
0/10 answered
Q1
In a binomial heap with n elements, what is the maximum number of trees?
A
log (n)
B
number of 1s in binary representation of n
C
n
D
sqrtn
← Prev
1 / 10
Next →
← Exercise 6
Exercise 7 of 7
All Exercises →