Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
Expert Solution & Answer
Book Icon
Chapter 3, Problem 31C

Explanation of Solution

Reimplementation of DoublyLinkedList class using only one sentinel node:

The doubly linked list is a linked data structure which contains the collection of sequentially data with two sentinel nodes such as “header” and “trailer”.

  • If there is only one sentinel node, then the list is circularly linked using sentinel node.
  • That is, header is sentinel node means, the next of the header is first node of list and previous node of header is last node of list.

Code for DoublyLinkedList class using only one sentinel node:

//Define the DoublyLinkedList class

public class DoublyLinkedList<E>

{

  //Declare only one sentinel node

private Node<E> header;

  //Declare and initialize the "size" variable

private int size = 0;

/*Define the Constructor to construct a new empty list. */

  public DoublyLinkedList()

  {

//Create header sentinel

header = new Node<>(null, null, null);

  }

//Define the size() method

  public int size()

  {

/*Returns the number of elements in the linked list. */

  return size;

  }

  //Define isEmpty() method

  public boolean isEmpty()

  {

  //Check whether the linked list is empty

  return size == 0;

  }

//Define first() method

  public E first()

  {

  //Check whether the list is empty

  if(isEmpty())

  //Return null

  return null;

//Returns the first element of the list

  return header.getNext().getElement();

  }

//Define last() method

  public E last( )

  {

  //Check whether the list is empty

  if(isEmpty())

  //Return null

  return null;

/*Returns the last element of the list using the single sentinel node "header". */

  return header.getPrev().getElement( );

  }

  //Define addFirst() method

  public void addFirst(E e)

  {

/*Call addBetween() method to adds element "e" to the front of the list. */

  addBetween(e, header, header.getNext

  }

  /Define the addLast() method

  public void addLast(E e)

  {

/*Call addBetween() method to adds element e to the end of the list using single sentinel node "header". */

  addBetween(e, header.getPrev(), header);

  }

//Define the removeFirst() method

  public E removeFirst()

  {

  //Check whether the list is empty

  if (isEmpty())

  //Return null

  return null;

/*Call remove() method to removes and returns the first element of the list. */

  return remove(header...

Blurred answer
Students have asked these similar questions
The images I have uploaded are the part 1 to 4 and questions below are continue on the questions uploaded 5. C++ Class Template with Method Stubs #pragma once #include <iostream> #include <string> #include <stdexcept> #include <vector>   template <typename T> class HashTable { private:     struct Entry {         std::string key;         T value;         bool isOccupied;         bool isDeleted;         Entry() : key(""), value(), isOccupied(false), isDeleted(false) {}     };       Entry* table;     size_t capacity;     size_t size;     double loadFactorThreshold;           size_t customHash(const std::string& key) const {         size_t hash = 5381;         for (char c : key) {             hash = ((hash  <<  5) + hash)  +  c;         }         return hash;     }       size_t probe(const std::string& key, bool forInsert = false) const;     void resize();   public:     // Constructor     HashTable(size_t initialCapacity = 101);         // Big…
this project is NOT for graded(marks) purposes, please help me with the introduction. give me answers for the project. i will include an image explaining everything about the project.
Java Graphics (Bonus In this lab, we'll be practicing what we learned about GUIs, and Mouse events. You will need to implement the following: A GUI with a drawing panel. We can click in this panel, and you will capture those clicks as a Point (see java.awt.Point) in a PointCollection class (you need to build this). The points need to be represented by circles. Below the drawing panel, you will need 5 buttons: O о о ○ An input button to register your mouse to the drawing panel. A show button to paint the points in your collection on the drawing panel. A button to shift all the points to the left by 50 pixels. The x position of the points is not allowed to go below zero. Another button to shift all the points to the right 50 pixels. " The x position of the points cannot go further than the You can implement this GUI in any way you choose. I suggest using the BorderLayout for a panel containing the buttons, and a GridLayout to hold the drawing panel and button panels. Regardless of how…
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,