COMS 250: Exam 3: Linked Lists
Studied by 0 people
Learn
Practice Test
Spaced Repetition
Match
FlashcardsADT stands for:
Abstract Data Type
A linked list is a series of connected_________.
nodes
1/17
There's no tags or description
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
18 Terms
ADT stands for:
Abstract Data Type
A linked list is a series of connected_________.
nodes
The ______ of a linked list points to the first node in the list.
head pointer or head
To append a node to a list means to ______.
add a node to the end of ithe list
The process of moving through a linked list is referred to as _________.
Traversing
If the head pointer points to nullptr, this indicates _______.
there are no nodes in the list
An insertion or deletion routine requires that you create this many pointers for use during the traversal process.
Two — one for the node being inserted, and one for the previous node.
How many steps are involved in the process of deleting a node?
two — remove the node without breaking links, then delete it from memory.
Appending a node means adding it to the end of a list, and ______ a node means putting a new node in the list, but not necessarily at the end.
inserting
If new data needs to be added to a linked list, the program simply ______ and inserts it into the series.
allocates another node
The advantage a linked list has over a vector is:
A node can be inserted into or removed from a linked list faster than from a vectorbecause linked lists can adjust pointers dynamically.
To create a linked list, you must first create a(n) __________.
struct
Which of the following is a basic linked list operation?
appending a node, traversing the list, inserting, or deleting a node
The last node in a linked list points to
a null pointer
A ______ is used to travel through a linked list and search for data.
pointer
While traversing a list, a node pointer knows when it has reached the end of a list when:
it encounters a null pointer
A linked list class must take care of removing the dynamically allocated nodes. This is done by _______.
the destructor function
To insert a new node in ascending order into a list, the list must be:
arranged in ascending order