PHP Data Structures - Circular Singly Linked List Other Related Topics
Python Java C++ C C# PHP R SQL DS Algo InterviewQ

PHP - Delete the last node of the Circular Singly Linked List



In this method, the last node of the circular singly linked list is deleted. For example - if the given list is 10->20->30->40 and the last node is deleted, the list becomes 10->20->30.

Deleting the last node of the Circular Singly Linked List involves checking the head for empty. If it is not empty and contains only one node then delete the head node. If the list contains more than one node then traverse to the second last node of the list and link it with the head. Finally, delete the last node.

Circular Singly Linked List - Delete Last Node

The function pop_back is created for this purpose. It is a 3-step process.

public function pop_back() {
  if($this->head != null) {
    
    //1. if head in not null and next of head
    //   is head, release the head
    if($this->head->next == $this->head) {
      $this->head = null;
    } else {
      
      //2. Else, traverse to the second last 
      //   element of the list
      $temp = new Node();
      $temp = $this->head;
      while($temp->next->next != $this->head)
        $temp = $temp->next;
      
      //3. Change the next of the second 
      //   last node to head and delete the
      //   last node
      $lastNode = $temp->next;
      $temp->next = $this->head; 
      $lastNode = null;
    }
  }
}

The below is a complete program that uses above discussed concept of deleting the last node of the circular singly linked list.

<?php
//node structure
class Node {
  public $data;
  public $next;
}

class LinkedList {
  public $head;

  public function __construct(){
    $this->head = null;
  }
  
  //Add new element at the end of the list
  public function push_back($newElement) {
    $newNode = new Node();
    $newNode->data = $newElement;
    $newNode->next = null; 
    if($this->head == null) {
      $this->head = $newNode;
      $newNode->next = $this->head;
    } else {
      $temp = new Node();
      $temp = $this->head;
      while($temp->next !== $this->head) {
        $temp = $temp->next;
      }
      $temp->next = $newNode;
      $newNode->next = $this->head;
    }    
  }

  //Delete last node of the list
  public function pop_back() {
    if($this->head != null) {
      if($this->head->next == $this->head) {
        $this->head = null;
      } else {
        $temp = new Node();
        $temp = $this->head;
        while($temp->next->next != $this->head)
          $temp = $temp->next;
        $lastNode = $temp->next;
        $temp->next = $this->head; 
        $lastNode = null;
      }
    }
  }

  //display the content of the list
  public function PrintList() {
    $temp = new Node();
    $temp = $this->head;
    if($temp != null) {
      echo "The list contains: ";
      while(true) {
        echo $temp->data." ";
        $temp = $temp->next;
        if($temp == $this->head)
          break;        
      }
      echo "\n";
    } else {
      echo "The list is empty.\n";
    }
  }    
};

// test the code  
$MyList = new LinkedList();

//Add four elements in the list.
$MyList->push_back(10);
$MyList->push_back(20);
$MyList->push_back(30);
$MyList->push_back(40);
$MyList->PrintList();

//Delete the last node
$MyList->pop_back();
$MyList->PrintList(); 
?>

The above code will give the following output:

The list contains: 10 20 30 40
The list contains: 10 20 30 

5