BST.TreeNode #element: E #left: TreeNode #right: TreeNode #parent: TreeNode
Redefine TreeNode by adding a reference to a node’s
parent, as given in the figure.
Reimplement the insert and delete methods in the BST class to update the
parent for each node in the tree. Add the following new method in BST:
/** Return the node for the specified element.
* Return null if the element is not in the tree. */
private TreeNode<E> getNode(E element)
/** Return true if the node for the element is a leaf */
private boolean isLeaf(E element)
/** Return the path of elements from the specified element
* to the root in an array list. */
public ArrayList<E> getPath(E e)
Write a test program that prompts the user to enter 10 integers, adds them to
the tree, deletes the first integer from the tree, and displays the paths for all leaf
nodes. Here is a sample run:
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
