Exercise 008

Which of the following are parts of a node in a linked list?

• Data and index

• Data and pointer

• Key and value

• Only data

How is data stored in a linked list?

• In contiguous memory locations.

• In an array format.

• In dynamically allocated nodes linked by pointers.

• In rows and columns.

What does the tail node of a linked list point to?

• The next node.

• The head node.

• Null.

• The previous node.

All parent Nodes are compared to their children Nodes in some specific way such as being more or less extreme in

• LinkedList.

• Dictionary.

• Tree.

• Heap.

Which of the following operations involves setting the new node’s previous pointer to null?

• Adding a node to the tail.

• Removing a node from the tail.

• Adding a node to the head.

• Removing a node from the middle.

To add a new node to the middle of a linked list, how many steps are involved?

• 1

• 2

• 3

• 4

What is a root node in a tree?

• The node with the highest level in the tree.

• The node with the lowest level in the tree.

• The node with no parent.

• The node with no children.

Each value within a dictionary doesn't have a special key associated with it.

• True

• False

The height of a tree is the number of edges on the longest possible path down towards a leaf.

• True

• False

A doubly-linked list allows traversal in both directions through the use of two pointers.

• True

• False