在单向链表末尾插入新节点的程序

2025年3月17日 | 阅读 7 分钟

说明

在此程序中，我们将创建一个单链表并在列表末尾添加一个新节点。为此，请在列表的尾部添加一个新节点，使尾部的 next 指向新添加的节点。然后，将此新节点设置为列表的新尾部。

Program to insert a new node at the end of the singly linked list

考虑上面的列表；节点 4 代表原始列表的尾部。令节点 New 是需要添加到列表末尾的新节点。将 4 的 next 指向 New。将 New 设置为列表的新尾部。

算法

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

解决方案

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 <stdio.h>
 
//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<T>{
        public T data;
        public Node<T> next;
        
        public Node(T value) {
            data = value;
            next = null;
        }
    }
        
    public class InsertEnd<T>{
        //Represent the head and tail of the singly linked list
        public Node<T> head = null;             
         public Node<T> tail = null;
    
        //addAtEnd() will add a new node to the end of the list
        public void addAtEnd(T data) {
            //Create a new node
            Node<T> newNode = new Node<T>(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<T> 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<int> sList = new InsertEnd<int>();
        
        //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

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of singly linked list
class Node{
    public $data;
    public $next;
    
    function __construct($data){
        $this->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 <br>");
            return;
        }
        print("Adding nodes to the end of the list: <br>");
        while($current != NULL) {
            //Prints each node by incrementing pointer
            print($current->data . " ");
            $current = $current->next;
        }
        print("<br>");
    }
}
 
$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();
?>
</body>
</html>

输出

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

下一主题#

在单向链表末尾插入新节点的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

在单向链表末尾插入新节点的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

从单向链表末尾删除节点的程序

计算单利息的程序

程序列表 | 编程示例

计算两个矩阵之差的程序

编写查找二十面体（Icosahedron）面积的程序

查找二叉树中距离最远的节点的程序

打印数字图案 8 的程序

确定单向链表是否为回文串的程序

查找字符串的所有可能子集的程序

确定给定数字是否为亏数（Deficient number）的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器