Searching Algorithms and Time Complexity

What is the time complexity of a linear search algorithm in the worst-case scenario?

Which of the following is a requirement for using a binary search algorithm?

• The list must be unsorted

• The list must be sorted

• The list must contain only integers

• The list must contain only positive numbers

In a binary tree, which traversal method visits the root node first, then the left subtree, and finally the right subtree?

• In-order traversal

• Pre-order traversal

• Post-order traversal

• Level-order traversal

What is the average time complexity of a binary search algorithm?

Which of the following is true about linear search?

• It can only be used on sorted lists

• It can be used on both sorted and unsorted lists

• It is faster than binary search on large datasets

• It requires a binary tree structure

In a binary tree, which traversal method visits all the nodes at the present depth level before moving on to the nodes at the next depth level?

• In-order traversal

• Pre-order traversal

• Post-order traversal

• Level-order traversal

What is the time complexity of searching for an element in a balanced binary search tree in the average case?

Which of the following is NOT a type of binary tree traversal?

• In-order traversal

• Pre-order traversal

• Post-order traversal

• Reverse-order traversal

What is the main disadvantage of a linear search compared to a binary search?

• It requires more memory

• It is slower on average

• It can only be used on sorted lists

• It is more complex to implement

In a binary search, if the target value is less than the middle element, which part of the list is searched next?

• The entire list

• The left half of the list

• The right half of the list

• None of the list