Lesson 3: Linked Lists ADT Flashcards

1
Q

data structure that implements a collection using a sequence of linked nodes containing data fields and pointers to the next node (or) next node and previous nodes based on its type

A

Linked List

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

an element of a list, usually implemented as an object that contains a reference to another object of the same type

A

Nodes

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

used to contain the value of the element

A

Data field

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

contains the address of the next node in the list

A

Pointer field

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

Types of Linked Lists (clue: SD)

A

Singly-linked list
Doubly-linked list

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

[Types of Linked Lists] sequence of dynamically allocated objects, each of which refers to its successor in the list

A

Singly-linked list

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

[Types of Linked Lists] sequence of nodes that points to successor and also predecessor

A

Doubly-linked list

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

[Types of Linked Lists] Where are the two nulls in doubly-linked list?

A

At the first and last nodes in the list

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