AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
It is a pile in which items ar...
It is a pile in which items are added at one end and removed from the other.
queue
Correct
Similar ITE-6201 questions
In C++ using positions() means to Return a position list of all the nodes of the tree.
Which of the following is not the required condition for binary search algorithm?
Partition and exchange sort is .
A bank simulation of its teller operation to see how waiting times would be affected by adding anoth...
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is call...
In the stack, if the user try to remove element from the empty stack then it is called as