数据结构在Java中的应用：链表、树等实现案例

原创灰太狼 2024-09-12 03:33 47阅读 0赞

在Java中，我们可以使用抽象类来定义各种数据结构，如链表、树等。以下是一些具体的实现案例：

1. 链表（LinkedList）
```java
public class LinkedList {
    Node head;

// Node class
    static class Node {
        int data;
        Node next;

Node(int d) {
            data = d;
            next = null;
        }
    }

// Add a new node at the end
    void append(int data) {
        Node newNode = new Node(data);
        if (head == null) {
            head = newNode;
        } else {
            Node lastNode = head;
            while (lastNode.next != null) {
                lastNode = lastNode.next;
            }
            lastNode.next = newNode;
        }
    }

// Display the linked list
    void display() {
        Node currentNode = head;
        System.out.print("LinkedList: ");
        while (currentNode != null) {
            System.out.print(currentNode.data + " -> ");
            currentNode = currentNode.next;
        }
        System.out.println();
    }
}
```

2. 树（Tree）
```java
import java.util.ArrayList;

public class Tree {
    private Node root;

// Node class
    static class Node {
        int data;
        Node left, right;

Node(int d) {
            data = d;
            left = null;
            right = null;
        }
    }

// Add a new node at the end
    void append(int data) {
        if (root == null) {
            root = new Node(data);
        } else {
            Node newNode = new Node(data);
            if (data < root.data) {
                newNode.left = root.left;
                newNode.right = root.right;
                if (root.left != null) {
                    root.left.parent = newNode;
                }
                if (root.right != null) {
                    root.right.parent = newNode;
                }
                root = newNode;
            } else if (data > root.data) {
                newNode.left = root.left;
                newNode.right = root.right;
                if (root.left != null) {
                    root.left.parent = newNode;
                }
                if (root.right != null) {
                    root.right.parent = newNode;
                }
                root = newNode;
            } else { // Data is equal to root data
                newNode.left = root.left;
                newNode.right = root.right;
                if (root.left != null) {
                    root.left.parent = newNode;
                }
                if (root.right != null) {
                    root.right.parent = newNode;
                }
                root = newNode;
            }
        }
    }

// Display the tree
    void display() {
        displayTree(root);
    }

// Recursive function to display the tree
    private void displayTree(Node node) {
        if (node != null) {
            System.out.print(node.data + " -> ");
            displayTree(node.left);
            displayTree(node.right);
        }
    }
}
```

以上就是Java中链表、树等数据结构的实现案例。