AlgoWhiz Quiz

What is the time complexity of iterating through all elements in an array?

• O(1)

• O(log n)

• O(n)

• O(n^2)

In which type of tree is every parent node's value greater than the values of its child nodes?

• • Binary Search Tree

•  AVL Tree

• •  Max Heap

• • Red-Black Tree

What is the pre-order traversal of a binary tree?

• • Visiting the left subtree, then the root, then the right subtree.

• • Visiting the root, then the left subtree, then the right subtree.

• •  Visiting the left subtree, then the right subtree, then the root.

• There is no specific order for pre-order traversal.

What is the best data structure to use for storing a collection of unique elements and checking if a specific element exists?

• •  Array

• • Linked List

• Hash Table

• Stack

What is the time complexity of inserting an element at the beginning of a singly linked list?

• O(1)

• O(log n)

• O(n)

• O(n^2)

What is the main advantage of using a hash table over a linked list for search operations?

• • Lower memory usage

• Better average-case time complexity

• • Easier to implement

• Supports sorted data

Which of the following properties does a Binary Search Tree (BST) maintain?

• All nodes have at most two children

• • All nodes are either red or black

•  Left subtree contains values less than the node, right subtree contains values greater

• All levels are fully filled except possibly the last

Which sorting algorithm is stable and works well with linked lists?

• Quick Sort

• • Bubble Sort

• •  Merge Sort

• • Selection Sort

What is the index of the first element in an array?

• -1

• 0

• 1

• 2

What is the time complexity of inserting an element at the end of a singly linked list (assuming no tail pointer)?

• O(1)

• O(log n)

• O(n)

• O(n^2)