数据结构中的基本结构分析

线性数据结构有 线性表、栈、队列、串、数组和文件；非线性数据结构有 树和图。文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

* 线性表的数据结构是 n 个数据元素的有限序列：

$\left( {{{\rm{a}}_1},{a_2} \cdots {a_n}} \right)$
* n 为线性表的长度（$n \ge 0$）, `n=0` 的表称为空表。

线性表按照其存储结构可以分为 顺序表 和 链表 。文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

用顺序存储结构存储的线性表称为​ 顺序表 。文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

用链式存储结构存储的线性表称为 链表 。文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

单向链表文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

​​文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

插入文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

​​文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

删除文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

​​文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

单链表使用案例：文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

// 需求：定义一个 Node 节点，包含 node1、node2、node3 ；然后在 node1和 node2 之间插入 node4 ，最后删除 node4 。

// Node.java
public class Node {
  /**
   * 存放节点数据本身
   */
  String data;

  /**
   * 存放指向下一个节点的引用
   */
  Node next;

  @Override
  public String toString() {
      return "Node{" +
              "data='" + data + '\'' +
              ", next=" + next +
              '}';
  }
}

// NodeTest.java
public class NodeTest {
  public static void main(String[] args) {
      Node node1 = new Node();
      node1.data = "node1";
      Node node2 = new Node();
      node2.data = "node2";
      Node node3 = new Node();
      node3.data = "node3";

      node1.next = node2;
      node2.next = node3;

      System.out.println("node1=>" + node1);
      System.out.println("node2=>" + node2);
      System.out.println("node3=>" + node3);
      System.out.println("----------------------");

      System.out.println(node1.next.next.data);
      System.out.println("----------------------");

      // 在node1和node2之间插入node4
      Node node4 = new Node();
      node4.data = "node4";
      node4.next = node2;
      node1.next = node4;

      System.out.println(node1.next.next.next.data);
      System.out.println("----------------------");

      // 删除node4
      node1.next = node4.next;
      node4 = null;

      System.out.println(node1.next.next.data);
  }
}

​​文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

双向循环链表文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html

​​文章源自浅海拾贝-https://blog.terwergreen.com/basic-structural-analysis-in-data-structure-171wfj.html