AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
This form of access is used to...
This form of access is used to add/remove nodes from a stack.
None of these
FIFO
LIFO
Correct
Both of these
Similar ITE-6201 questions
The complexity of sorting algorithm measures the as a function of the number n of items to be short...
The complexity of bubble sort algorithm.
This is a terminal node in a binary tree.
The depth of complete binary tree is given by .
This is a binary tree whose every node has either zero or two children.
The root of a tree is the node that has no ancestors.