数据结构示例-双向链表的末尾删除节点

📌 相关文章

📜 数据结构示例-双向链表的末尾删除节点

📅 最后修改于: 2020-10-15 05:28:55 🧑 作者: Mango

问：程序从双链表的末尾删除一个新节点。

说明

在此程序中，我们将创建一个双向链接列表，并从列表末尾删除一个节点。如果列表为空，则print消息“列表为空”。如果列表不为空，则尾部的前一个节点将成为列表的新尾部，从而从列表中删除最后一个节点。

在上面的示例中，节点new是列表的结尾。将尾部的前一个节点(即节点4)作为列表的尾部。节点4的下一个将指向null。

算法

定义一个Node类，该类代表列表中的一个节点。它具有三个属性：数据，前一个将指向上一个节点，下一个将指向下一个节点。
定义另一个类来创建双向链表，它有两个节点：head和tail。最初，头和尾将指向null。
deleteFromEnd()将从列表末尾删除一个节点：
1. 它首先检查head是否为空(空列表)，然后它将从函数返回，因为列表中没有节点。
2. 如果列表不为空，它将检查列表是否只有一个节点。
3. 如果列表只有一个节点，则它将head和tail都设置为null。
4. 如果列表具有多个节点，则尾部的前一个节点将成为列表的新尾部。
5. 这个新尾巴将指向null，因此删除列表的最后一个节点。
display()将显示列表中存在的所有节点。
1. 定义一个新节点“当前”，该节点将指向头部。
2. 打印current.data直到current指向null。
3. 当前将在每次迭代中指向列表中的下一个节点。

示例：

Python

#Represent a node of doubly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.previous = None;
        self.next = None;
        
class DeleteEnd:
    #Represent the head and tail of the doubly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #If list is empty
        if(self.head == None):
            #Both head and tail will point to newNode
            self.head = self.tail = newNode;
            #head's previous will point to None
            self.head.previous = None;
            #tail's next will point to None, as it is the last node of the list
            self.tail.next = None;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode's previous will point to tail
            newNode.previous = self.tail;
            #newNode will become new tail
            self.tail = newNode;
            #As it is last node, tail's next will point to None
            self.tail.next = None;
            
    #deleteFromEnd() will delete a node from the end of the list
    def deleteFromEnd(self):
        #Checks whether list is empty
        if(self.head == None):
            return;
        else:
            #Checks whether the list contains only one node
            if(self.head != self.tail):
                #Previous node to the tail will become new tail
                self.tail = self.tail.previous;
                #Node next to current tail will be made None
                self.tail.next = None;
                
            #If the list contains only one element 
            #Then it will remove the node, and now both head and tail will point to None

            else:
                self.head = self.tail = None;
                
    #display() will print out the nodes of the list
    def display(self):
        #Node current will point to head
        current = self.head;
        if(self.head == None):
            print("List is empty");
            return;
        while(current != None):
            #Prints each node by incrementing pointer.
            print(current.data),
            current = current.next;
        print();
       
dList = DeleteEnd();
#Add nodes to the list
dList.addNode(1);
dList.addNode(2);
dList.addNode(3);
dList.addNode(4);
dList.addNode(5);
 
#Printing original list
print("Original List: ");
dList.display();
while(dList.head != None):
    dList.deleteFromEnd();
    #Printing updated list
    print("Updated List: ");
    dList.display();

输出：

Original List: 
1 2 3 4 5 
Updated List: 
1 2 3 4 
Updated List: 
1 2 3 
Updated List: 
1 2 
Updated List: 
1 
Updated List: 
List is empty

C

#include 
 
//Represent a node of the doubly linked list

struct node{
    int data;
    struct node *previous;
    struct node *next;
};    
 
//Represent the head and tail of the doubly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    
    //If list is empty
    if(head == NULL) {
        //Both head and tail will point to newNode
        head = tail = newNode;
        //head's previous will point to NULL
        head->previous = NULL;
        //tail's next will point to NULL, as it is the last node of the list
        tail->next = NULL;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode's previous will point to tail
        newNode->previous = tail;
        //newNode will become new tail
        tail = newNode;
        //As it is last node, tail's next will point to NULL
        tail->next = NULL;
    }
}
 
//deleteFromEnd() will delete a node from the end of the list
void deleteFromEnd() {
    //Checks whether list is empty
    if(head == NULL) {
        return;
    }
    else {
        //Checks whether the list contains only one node
        if(head != tail) {
            //Previous node to the tail will become new tail
            tail = tail->previous;
            //Node next to current tail will be made NULL
            tail->next = NULL;
        }
        //If the list contains only one element 
        //Then it will remove node and now both head and tail will point to NULL
        else {
            head = tail = NULL;
        }
    }
}
 
//display() will print out the nodes of the list
void display() {
    //Node current will point to head
    struct node *current = head;
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    while(current != NULL) {
        //Prints each node by incrementing pointer.
        printf("%d ",current->data);
        current = current->next;
    }
    printf("\n");
}
    
int main()
{
    //Add nodes to the list
    addNode(1);
    addNode(2);
    addNode(3);
    addNode(4);
    addNode(5);
    
    //Printing original list
    printf("Original List: \n");
    display();
    while(head != NULL) {
        deleteFromEnd();
        //Printing updated list
        printf("Updated List: \n");
        display();
    }    
 
    return 0;
}

输出：

Original List: 
1 2 3 4 5 
Updated List: 
1 2 3 4 
Updated List: 
1 2 3 
Updated List: 
1 2 
Updated List: 
1 
Updated List: 
List is empty

JAVA

public class DeleteEnd {
    
    //Represent a node of the doubly linked list

    class Node{
        int data;
        Node previous;
        Node next;
        
        public Node(int data) {
            this.data = data;
        }
    }
    
    //Represent the head and tail of the doubly linked list
    Node head, tail = null;
    
    //addNode() will add a node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //If list is empty
        if(head == null) {
            //Both head and tail will point to newNode
            head = tail = newNode;
            //head's previous will point to null
            head.previous = null;
            //tail's next will point to null, as it is the last node of the list
            tail.next = null;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode's previous will point to tail
            newNode.previous = tail;
            //newNode will become new tail
            tail = newNode;
            //As it is last node, tail's next will point to null
            tail.next = null;
        }
    }
    
    //deleteFromEnd() will delete a node from the end of the list
    public void deleteFromEnd() {
        //Checks whether list is empty
        if(head == null) {
            return;
        }
        else {
            //Checks whether the list contains only one node
            if(head != tail) {
                //Previous node to the tail will become new tail
                tail = tail.previous;
                //Node next to current tail will be made null
                tail.next = null;
            }
            //If the list contains only one element 
            //Then it will remove node and now both head and tail will point to null
            else {
                head = tail = null;
            }
        }
    }
    
    //display() will print out the nodes of the list
    public void display() {
        //Node current will point to head
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        while(current != null) {
            //Prints each node by incrementing the pointer.

            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        DeleteEnd dList = new DeleteEnd();
        //Add nodes to the list
        dList.addNode(1);
        dList.addNode(2);
        dList.addNode(3);
        dList.addNode(4);
        dList.addNode(5);
        
        //Printing original list
        System.out.println("Original List: ");
        dList.display();
        while(dList.head != null) {
            dList.deleteFromEnd();
            //Printing updated list
            System.out.println("Updated List: ");
            dList.display();
        }    
    }
}

输出：

Original List: 
1 2 3 4 5 
Updated List: 
1 2 3 4 
Updated List: 
1 2 3 
Updated List: 
1 2 
Updated List: 
1 
Updated List: 
List is empty

C＃

using System; 
namespace DoublyLinkedList 
{                     
    public class Program
    {
        //Represent a node of the doubly linked list

        public class Node{
            public T data;
            public Node previous;
            public Node next;
            
            public Node(T value) {
                data = value;
            }
        }
        
        public class DeleteEnd{
            //Represent the head and tail of the doubly linked list
            public Node head = null;             
             public Node tail = null;
            
            //addNode() will add a node to the list
            public void addNode(T data) {
                //Create a new node
                Node newNode = new Node(data);
 
                //If list is empty
                if(head == null) {
                    //Both head and tail will point to newNode
                    head = tail = newNode;
                    //head's previous will point to null
                    head.previous = null;
                    //tail's next will point to null, as it is the last node of the list
                    tail.next = null;
                }
                else {
                    //newNode will be added after tail such that tail's next will point to newNode
                    tail.next = newNode;
                    //newNode's previous will point to tail
                    newNode.previous = tail;
                    //newNode will become new tail
                    tail = newNode;
                    //As it is last node, tail's next will point to null
                    tail.next = null;
                }
            }
    
            //deleteFromEnd() will delete a node from the end of the list
            public void deleteFromEnd() {
                //Checks whether list is empty
                if(head == null) {
                    return;
                }
                else {
                    //Checks whether the list contains only one node
                    if(head != tail) {
                        //Previous node to the tail will become new tail
                        tail = tail.previous;
                        //Node next to current tail will be made null
                        tail.next = null;
                    }
                    //If the list contains only one element 
                    //Then it will remove node and now both head and tail will point to null
                    else {
                        head = tail = null;
                    }
                }
            }
    
            //display() will print out the nodes of the list
            public void display() {
                //Node current will point to head
                Node current = head;
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return;
                }
                while(current != null) {
                    //Prints each node by incrementing the pointer.

                    Console.Write(current.data + " ");
                    current = current.next;
                }
                Console.WriteLine();
            }
        }
        
        public static void Main()
        {
            DeleteEnd dList = new DeleteEnd();
            //Add nodes to the list
            dList.addNode(1);
            dList.addNode(2);
            dList.addNode(3);
            dList.addNode(4);
            dList.addNode(5);
 
            //Printing original list
            Console.WriteLine("Original List: ");
            dList.display();
            while(dList.head != null) {
                dList.deleteFromEnd();
                //Printing updated list
                Console.WriteLine("Updated List: ");
                dList.display();
            }    
        }    
    }
}

输出：

Original List: 
1 2 3 4 5 
Updated List: 
1 2 3 4 
Updated List: 
1 2 3 
Updated List: 
1 2 
Updated List: 
1 
Updated List: 
List is empty

PHP：




data = $data;
    }
}
class DeleteEnd{
    //Represent the head and tail of the doubly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a node to the list
    function addNode($data) {
        //Create a new node
        $newNode = new Node($data);
        
        //If list is empty
        if($this->head == NULL) {
            //Both head and tail will point to newNode
            $this->head = $this->tail = $newNode;
            //head's previous will point to NULL
            $this->head->previous = NULL;
            //tail's next will point to NULL, as it is the last node of the list
            $this->tail->next = NULL;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode's previous will point to tail
            $newNode->previous = $this->tail;
            //newNode will become new tail
            $this->tail = $newNode;
            //As it is last node, tail's next will point to NULL
            $this->tail->next = NULL;
        }
    }
    
    //deleteFromEnd() will delete a node from the end of the list
    function deleteFromEnd() {
        //Checks whether list is empty
        if($this->head == NULL) {
            return;
        }
        else {
            //Checks whether the list contains only one node
            if($this->head != $this->tail) {
                //Previous node to the tail will become new tail
                $this->tail = $this->tail->previous;
                //Node next to current tail will be made null
                $this->tail->next = NULL;
            }
            //If the list contains only one element 
            //Then it will remove node and now both head and tail will point to null
            else {
                $this->head = $this->tail = NULL;
            }
        }
    }
    
    //display() will print out the nodes of the list
    function display() {
        //Node current will point to head
        $current = $this->head;
        if($this->head == NULL) {
            print("List is empty 
");
            return;
        }
        while($current != NULL) {
            //Prints each node by incrementing pointer.
            print($current->data . " ");
            $current = $current->next;
        }
        print("
");
    }
}
    
$dList = new DeleteEnd();
//Add nodes to the list
$dList->addNode(1);
$dList->addNode(2);
$dList->addNode(3);
$dList->addNode(4);
$dList->addNode(5);
 
//Printing original list
print("Original List: 
");
$dList->display();
while($dList->head != NULL) {
    $dList->deleteFromEnd();
    //Printing updated list
    print("Updated List: 
");
    $dList->display();
}    
?>

输出：

Original List: 
1 2 3 4 5 
Updated List: 
1 2 3 4 
Updated List: 
1 2 3 
Updated List: 
1 2 
Updated List: 
1 
Updated List: 
List is empty