Data Structures

Question 1

Array Index

Answer 1

O(1)

Question 2

Array Search

Answer 2

O(n)

Question 3

Hash Table Search

Answer 3

O(1) avg, O(n) worst

Question 4

Hash Table Insertion/Deletion

Answer 4

O(1) avg, O(n) worst

Question 5

Arrays are optimal for?

Answer 5

Indexing. Slow to search, insert, and delete.

Question 6

Linked lists, stacks, and queues are optimal for?

Answer 6

Insertion and deletion. Slow at indexing and searching.

Question 7

Linked list, Stack, Queue Insertion/Deletion

Answer 7

O(1)

Question 8

Linked List, Stack, Queue Index/Search

Answer 8

O(n)

Question 9

HashMaps are optimal for?

Answer 9

Searching, insertion, and deletion

Question 10

Hash Collision

Answer 10

When a hash function returns the same output for two different inputs

Question 11

Binary Search Tree

Answer 11

Access, search, insertion, and deletion are all log n (light green)

Question 12

Heap

Answer 12

A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Generally, Heaps can be of two types:

Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.

Min-Heap: In a Min-Heap the key present at the root node must be minimum among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.