Question

im learning linked lists in java but am stuck on the following

Before deleting Hobnobs: bourbon, shortbread, Hobnobs, oreos

After deleting Hobnobs: bourbon, shortbread, oreos

i would like to create a delete method that will delete the intermediate node “Hobnobs”.

ive got this so far

 public class Biscuit {

 private BiscuitNode first;
 public Biscuit( )
 {
  this.first=null;
 }
 public BiscuitNode getFirst() {
  return first;
 }
 public void insert(BiscuitNode first) {
  this.first = first;
 }

 public void deleteFirst()
 {
  this.first.setSucc(this.first);
 }

 public void delete(String BiscuitName)
 {

the Hobnobs is “BiscuitNode secondLast=new BiscuitNode("Hobnobs", last);“

Answer 1

Walk the chain of nodes in a loop using getSucc() on the current node. Then, once you find the node that matches, make its predecessor point to its successor. E.g. if we want to delete node C from the following list:

A--->B--->C--->D

becomes

A--->B--->D

You should be able to figure it out.