Linked Lists Flashcards
1
Q
What is a node
A
An object that always at least holds the value and a pointer pointing to the next node
2
Q
What is the head
A
First node
3
Q
What is the tail
A
Points to the ending node
4
Q
~linkedlists()
A
Deallocates all remaining dynamically allocated memory (all remaninting nodes)
5
Q
Push front
A
Inserts a data value at the round end of the list
6
Q
Pop front
A
Removes value at the front end of the lift. Does nothing if the list is empty
7
Q
Why no pop back for singly linked lists
A
To as our
