数据结构示例-单向链表末端插入新节点

📌 相关文章

📜 数据结构示例-单向链表末端插入新节点

📅 最后修改于: 2020-10-15 04:49:01 🧑 作者: Mango

程序在单链列表的末尾插入一个新节点

说明

在此程序中，我们将创建一个单链接列表，并在列表末尾添加一个新节点。要完成此任务，请在列表尾部之后添加一个新节点，以使尾部的下一个指向新添加的节点。然后，将此新节点作为列表的新尾部。

考虑上面的清单；节点4代表原始列表的尾部。让node New是需要在列表末尾添加的新节点。使4旁边指向新。将New设为列表的新尾。

算法

创建一个具有两个属性的类Node：data和next。下一个是指向列表中下一个节点的指针。
创建另一个具有两个属性的头类InsertEnd：head和tail。
addAtEnd()将在列表的末尾添加一个新节点：
1. 创建一个新节点。
2. 它首先检查head是否等于null，这意味着列表为空。
3. 如果列表为空，则头和尾都将指向新添加的节点。
4. 如果列表不为空，则新节点将被添加到列表的末尾，使得尾部的下一个将指向新添加的节点。这个新节点将成为列表的新尾部。
display()将显示列表中存在的节点：
1. 定义一个节点电流，该电流将初始指向列表的开头。
2. 遍历列表，直到当前指向null。
3. 通过在每次迭代中使电流指向其旁边的节点来显示每个节点。

示例：

Python

#Represent a node of the singly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.next = None;
        
class InsertEnd:
    #Represent the head and tail of the singly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addAtEnd() will add a new node to the end of the list
    def addAtEnd(self, data):
        #Create a new node
        newNode = Node(data);
        
        #Checks if the list is empty
        if(self.head == None):
            #If list is empty, both head and tail will point to new node
            self.head = newNode;
            self.tail = newNode;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode will become new tail of the list
            self.tail = newNode;
            
    #display() will display all the nodes present in the list
    def display(self):
        #Node current will point to head
        current = self.head;
        
        if(self.head == None):
            print("List is empty");
            return;
            
        print("Adding nodes to the end of the list: ");
        while(current != None):
            #Prints each node by incrementing pointer
            print(current.data)
            current = current.next;
 
sList = InsertEnd();
        
#Adding 1 to the list
sList.addAtEnd(1);
sList.display();
 
#Adding 2 to the list
sList.addAtEnd(2);
sList.display();
 
#Adding 3 to the list
sList.addAtEnd(3);
sList.display();
 
#Adding 4 to the list
sList.addAtEnd(4);
sList.display();

输出：

 Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

C

#include 
 
//Represent a node of the singly linked list
struct node{
    int data;
    struct node *next;
};    
 
//Represent the head and tail of the singly linked list
struct node *head, *tail = NULL;
 
//addAtEnd() will add a new node to the end of the list
void addAtEnd(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    newNode->next = NULL;
    
    //Checks if the list is empty
    if(head == NULL) {
        //If list is empty, both head and tail will point to new node
        head = newNode;
        tail = newNode;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode will become new tail of the list
        tail = newNode;
    }
}
    
//display() will display all the nodes present in the list
void display() {
    //Node current will point to head
    struct node *current = head;
    
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    printf("Adding nodes to the end of the list: \n");
    while(current != NULL) {
        //Prints each node by incrementing pointer
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}
    
int main()
{
    //Adding 1 to the list
    addAtEnd(1);
    display();
    
    //Adding 2 to the list
    addAtEnd(2);
    display();
    
    //Adding 3 to the list
    addAtEnd(3);
    display();
    
    //Adding 4 to the list
    addAtEnd(4);
    display();
 
    return 0;
}

输出：

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

JAVA

public class InsertEnd {
    
    //Represent a node of the singly linked list
    class Node{
        int data;
        Node next;
        
        public Node(int data) {
            this.data = data;
            this.next = null;
        }
    }
 
    //Represent the head and tail of the singly linked list
    public Node head = null;
    public Node tail = null;
    
    //addAtEnd() will add a new node to the end of the list
    public void addAtEnd(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //Checks if the list is empty
        if(head == null) {
            //If list is empty, both head and tail will point to new node
            head = newNode;
            tail = newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode will become new tail of the list
            tail = newNode;
        }
    }
    
    //display() will display all the nodes present in the list
    public void display() {
        //Node current will point to head
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        System.out.println("Adding nodes to the end of the list: ");
        while(current != null) {
            //Prints each node by incrementing pointer
            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        InsertEnd sList = new InsertEnd();
        
        //Adding 1 to the list
        sList.addAtEnd(1);
        sList.display();
        
        //Adding 2 to the list
        sList.addAtEnd(2);
        sList.display();
        
        //Adding 3 to the list
        sList.addAtEnd(3);
        sList.display();
        
        //Adding 4 to the list
        sList.addAtEnd(4);
        sList.display();
    }
}

输出：

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

C＃

using System;
                    
public class CreateList
{
    //Represent a node of the singly linked list
    public class Node{
        public T data;
        public Node next;
        
        public Node(T value) {
            data = value;
            next = null;
        }
    }
        
    public class InsertEnd{
        //Represent the head and tail of the singly linked list
        public Node head = null;             
         public Node tail = null;
    
        //addAtEnd() will add a new node to the end of the list
        public void addAtEnd(T data) {
            //Create a new node
            Node newNode = new Node(data);
 
            //Checks if the list is empty
            if(head == null) {
                //If list is empty, both head and tail will point to new node
                head = newNode;
                tail = newNode;
            }
            else {
                //newNode will be added after tail such that tail's next will point to newNode
                tail.next = newNode;
                //newNode will become new tail of the list
                tail = newNode;
            }
        }
 
        //display() will display all the nodes present in the list
        public void display() {
            //Node current will point to head
            Node current = head;
            
            if(head == null) {
                Console.WriteLine("List is empty");
                return;
            }
            Console.WriteLine("Adding nodes to the end of the list: ");
            while(current != null) {
                //Prints each node by incrementing pointer
                Console.Write(current.data + " ");
                current = current.next;
            }
            Console.WriteLine();
        }
    }
    
    public static void Main()
    {
        InsertEnd sList = new InsertEnd();
        
        //Adding 1 to the list
        sList.addAtEnd(1);
        sList.display();
        
        //Adding 2 to the list
        sList.addAtEnd(2);
        sList.display();
        
        //Adding 3 to the list
        sList.addAtEnd(3);
        sList.display();
        
        //Adding 4 to the list
        sList.addAtEnd(4);
        sList.display();
    }
}

输出：

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4

PHP：




data = $data;
        $this->next = NULL;
    }
}
class InsertEnd{
    //Represent the head and tail of the singly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addAtEnd() will add a new node to the end of the list
    function addAtEnd($data) {
        //Create a new node
        $newNode = new Node($data);
        
        //Checks if the list is empty
        if($this->head == null) {
            //If list is empty, both head and tail will point to new node
            $this->head = $newNode;
            $this->tail = $newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode will become new tail of the list
            $this->tail = $newNode;
        }
    }
    
    //display() will display all the nodes present in the list
    function display() {
        //Node current will point to head
        $current = $this->head;
        
        if($this->head == NULL) {
            print("List is empty 
");
            return;
        }
        print("Adding nodes to the end of the list: 
");
        while($current != NULL) {
            //Prints each node by incrementing pointer
            print($current->data . " ");
            $current = $current->next;
        }
        print("
");
    }
}
 
$sList = new InsertEnd();
        
//Adding 1 to the list
$sList->addAtEnd(1);
$sList->display();
 
//Adding 2 to the list
$sList->addAtEnd(2);
$sList->display();
 
//Adding 3 to the list
$sList->addAtEnd(3);
$sList->display();
 
//Adding 4 to the list
$sList->addAtEnd(4);
$sList->display();
?>

输出：

Adding nodes to the end of the list: 
1 
Adding nodes to the end of the list: 
1 2 
Adding nodes to the end of the list: 
1 2 3 
Adding nodes to the end of the list: 
1 2 3 4