AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
When the largest element is at...
When the largest element is at its root it's called
Priority queue
Max-heap
Correct
Min-heap
Heap pointer
Similar ITE-6201 questions
What does the sequential representation of binary trees use?
Which indicates pre-order traversal?
What is a queue?
Which of the following is not the part of ADT description?
Which of the following data structure can't store the non-homogeneous data elements?
Which of the following is a two-way list?