AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
The upward movement of the new...
The upward movement of the newly inserted entry by means of swapping
up-heap swapping
up-heap sorting
up-heap traversing
up-heap bubbling
Correct
Similar ITE-6201 questions
The worst case occurs in linear search algorithm when .
The following are some of the applications of heaps except
The complexity of linear search algorithm.
the upward movement of the newly inserted entry by means of swaps is conventionally called
The terms depth-first and breadth-first are two most common graph algorithm
The operation commonly performed in graphs that store the graph in computer memory using a particula...