Linked Lists

Question 1

What is a node

Answer 1

An object that always at least holds the value and a pointer pointing to the next node

Question 2

What is the head

Answer 2

First node

Question 3

What is the tail

Answer 3

Points to the ending node

Question 4

~linkedlists()

Answer 4

Deallocates all remaining dynamically allocated memory (all remaninting nodes)

Question 5

Push front

Answer 5

Inserts a data value at the round end of the list

Question 6

Pop front

Answer 6

Removes value at the front end of the lift. Does nothing if the list is empty

Question 7

Why no pop back for singly linked lists

Answer 7

To as our