Question

(Java)

public void Delete(int item) f if (IsEmpty) ) Node 1-headNode; Node m headNode.link; while ((m.datum!- item)&& (m endNode)) f 1 01 m m.link; 1- 1.link İf (m.datum..item) { 1.link-m.link;

This is a delete method for a linked list, add a system print or something when the item I want to delete isn’t in the linked list

This is the method I want to use so please help me without writing a different code but instead add upon this code

Answer 1

public void Delete (int item){

      int count = 0;

      if(!isEmpty() ){

            Node l = headNode;

            Node m = headNode.link;

            while((m.datum != item)&&(m != endNode)){

                  m= m.link;

                  l = l.link;

            }

            if(m.datum == item) {

                  l.link = m.link;

                  //Count is incremented whenever delete item is found in list

                  count ++;

            }

      }

      //If count is 0; then item is not found in list

      if(count==0){

            System.out.println("Item not Found");

      }

      else{

            System.out.println(count+" Items are deleted");

      }

}