The breadth-first traversal (BFS) is a method to traverse______

Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

Which of the following tree traversal techniques reads the root before its children nodes?

Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

Which of the following stack operations could result in a stack underflow?

In an AVL tree, if the balance factor of a node is -1, which of the following statement/s is/are true?

Which of the following data structures has a balanced condition?

A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

What is the meaning of the statement: "Entries in a stack are 'ordered'"?

Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?