Binary Search Tree

In which of the following cases, binary search algorithm is used?​

• To search an element in an unordered list.​

• To search an element in a list of few elements.

• To search an element in any ordered list with large number of elements.​

Which figure below represent the binary tree of the following values: { 25, 18, 6, 12, 30, 27, 22, 32 }

• 
• 
• 
• 

On average, which searching algorithm is more efficient?

• Binary Search
• Linear Search

Which figure below represent the binary tree of the following values: { 18, 6, 12, 22, 25, 30, 20, 2 }

• 
• 
• 
• 

Which figure below represent the binary tree of the following values:{ 20, 30, 18, 22, 25, 6, 2 }

• 
• 
• 
• 

What is meant by the time complexity of an algorithm?

• The amount of time required to solve a particular problem
• How difficult a problem is to solve
• How many lines of code are required to solve a problem
• How quickly a solution can be developed

How does a binary search algorithm works?​

• Dividing the list into halves until the item is matched with one in the list.​

• Starts with the first element and checks the next element consecutively until a match is found.

• ​ None of the above​

A linear search algorithm is also known as a...

• Binary search algorithm
• Bubble sort algorithm
• Sequential search algorithm

Which figure below represent the binary tree of the following values: {18, 12, 22, 25, 30, 6, 20, 2 }

• 
• 
• 
• 

An array with 32 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?​

• 32

• 16

• 8

• 5