In-Lab5

What is the time complexity of binary search on a sorted array?

• O(1)

• O(n log n)

• O(log n)

• O(n)

What is the depth of a leaf node in a tree?

• Depth is undefined

• 2

• 0

• 1

In a binary search tree, the data in the left sub-tree is:

• Less than or equal to the parent node

• Greater than the parent node

• Randomly distributed

• Equal to the parent node

What is the worst-case depth of a binary search tree when inserting elements in sorted order?

• O(log n)

• O(n log n)

• O(1)

• O(n)

Which traversal method visits nodes in the order of left, root, right?

• In-order

• Level-order

• Pre-order

• Post-order

What is the purpose of the 'next' pointer in a binary search tree?

• To point to the root node

• To point to the maximum of the left subtree

• To point to the minimum of the right subtree

• To point to the parent node

What happens when you remove a node with two children in a binary search tree?

• Replace it with its right child

• Relabel it with the value of its in-order successor

• Replace it with its left child

• Simply delete the node

Which of the following is a characteristic of a complete binary tree?

• All levels are fully filled except possibly the last

• It can be represented as a linked list

• All leaf nodes are at the same depth

• Each node has exactly two children

What is the time complexity of inserting an element into a binary search tree?

• O(1)

• O(n log n)

• O(log n)

• O(n)

In a breadth-first traversal, which data structure is typically used?

• Queue

• Linked List

• Stack

• Array