Exam 15: Linked Data Structures

Create a generic Node class to represent the linked list depicted in your diagrams above.

Write a method called displayList that displays the data items in the Node class created in number 6 above.

Redraw the diagram created in number 2 above after inserting a node containing Chattanooga,27.6.

Recursively visiting the left subtree,right subtree and then the root describes:

Making the Node class a private inner class of a linked data structure is an example of:

Given the Node class created in number 6 above,write Java statements to delete a node from the beginning of the list.

Discuss the differences between a queue and a stack.

Forgetting to set the reference instance variable of the last node in a linked list to null will cause a logic error.

A _________________ maps a data value such as a String into a number:

Redraw the diagram created in number 3 above,after deleting the node containing Chicago.

In Java,a node is a/an:

A binary tree has exactly _________ link instance variables.

In Java,you indicate the end of a linked list be setting the link instance variable of the last node in the linked list to __________.

A common exception that occurs when using linked lists is the:

Linked lists introduce the possibility of a privacy leak occurring.

To use the Java Iterator Interface you must import the ____________ package.

If you define a clone method,the class should implement the Cloneable interface.

Redraw the diagram created in number 4 above after deleting the head node.

A queue is a last-in/first-out structure.

Given the Node class created in number 6 above,write Java statements to insert a new node containing (Chattanooga,23.7)into an empty list.