Data Structures Flashcards

1
Q

What is a linked list?

A

A list that involves nodes that point to the next item in the list.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a stack?

A

An Abstract Data Structure (ADT) that is a LIFO. Last-in First-Out nature. Think stack of books

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is a queue?

A

An Abstract Data Structure (ADT) that is FIFO. First in First out. Think of a line in a grocery store

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Breadth FIrst / Level Order Traversal

A

Traverse all nodes at one level before heading to the next

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Depth First Search (Traversal)

A

Completely traverse a sub-tree before before traversing a sibling tree

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In Order Traversal

A

Left -> Current -> Right

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Post Order Traversal

A

Left -> Right -> Current

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Pre Order Traversal

A

Current -> Left -> Right

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Hashing

A

Maps a key to a unique integer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Hash Table Access

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Hash Table Space

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Hash Table Insert

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Hash Table Delete

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a Hash table

A

A data structure that maps keys to values using an associative array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

BST Access Avg.

A

O(n log n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

BST Search Avg.

A

O(n log n)

17
Q

BST Insertion Avg.

A

O(n log n)

18
Q

BST Deletion Avg.

A

O(n log n)

19
Q

Heap Order Property

A

No child has a key less than its parents key