Deck 16: Linked Lists

Full screen (f)
exit full mode
Question
What are the two components of a node in a linked list?
Use Space or
up arrow
down arrow
to flip the card.
Question
The address of the first node in a list is stored in a separate location, called the ____________________.
Question
The data type of a node pointer is the node type itself.
Question
The link of the last node in a linked list has the value ____________________.
Question
In general, what are the two types of linked lists?
Question
The node of a linked list is implemented as a(n) ____________________ in this chapter.
Question
The linkedListType class presented in this chapter has two member variables.
Question
What operations does the unorderedLinkedList class in this chapter implement?
Question
The deleteNode function of an unordered list considers ____________________ general cases.
Question
Define a circular linked list.
Question
The list implementations in this chapter use a binary search algorithm for the search function.
Question
What does these terms refer to:

- \gg Circular linked list:
Question
What does these terms refer to:

- \gg Head (first):
Question
What does these terms refer to:

- \gg Iterator:
Question
What does these terms refer to:

- \gg Link:
Question
What does these terms refer to:

- \gg Linked list:
Question
What does these terms refer to:

- \gg Nodes:
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/17
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 16: Linked Lists
1
What are the two components of a node in a linked list?
The data and a link to the next node in the list
2
The address of the first node in a list is stored in a separate location, called the ____________________.
head, first
3
The data type of a node pointer is the node type itself.
True
4
The link of the last node in a linked list has the value ____________________.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
5
In general, what are the two types of linked lists?
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
6
The node of a linked list is implemented as a(n) ____________________ in this chapter.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
7
The linkedListType class presented in this chapter has two member variables.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
8
What operations does the unorderedLinkedList class in this chapter implement?
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
9
The deleteNode function of an unordered list considers ____________________ general cases.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
10
Define a circular linked list.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
11
The list implementations in this chapter use a binary search algorithm for the search function.
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
12
What does these terms refer to:

- \gg Circular linked list:
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
13
What does these terms refer to:

- \gg Head (first):
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
14
What does these terms refer to:

- \gg Iterator:
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
15
What does these terms refer to:

- \gg Link:
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
16
What does these terms refer to:

- \gg Linked list:
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
17
What does these terms refer to:

- \gg Nodes:
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 17 flashcards in this deck.