Java 采用二叉树的二叉链存储结构,构建一颗含10个结点的二叉树
时间: 2023-11-14 18:08:12 浏览: 29
好的,下面是Java代码实现:
```java
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
public TreeNode(int val) {
this.val = val;
this.left = null;
this.right = null;
}
}
public class BinaryTree {
private TreeNode root;
public BinaryTree() {
this.root = null;
}
public void buildTree() {
TreeNode node1 = new TreeNode(1);
TreeNode node2 = new TreeNode(2);
TreeNode node3 = new TreeNode(3);
TreeNode node4 = new TreeNode(4);
TreeNode node5 = new TreeNode(5);
TreeNode node6 = new TreeNode(6);
TreeNode node7 = new TreeNode(7);
TreeNode node8 = new TreeNode(8);
TreeNode node9 = new TreeNode(9);
TreeNode node10 = new TreeNode(10);
node1.left = node2;
node1.right = node3;
node2.left = node4;
node2.right = node5;
node3.left = node6;
node3.right = node7;
node4.left = node8;
node4.right = node9;
node5.left = node10;
root = node1;
}
}
```
在这个二叉树中,每个节点都有一个int类型的值,以及左右两个子节点。我们可以通过`buildTree()`方法构建这个二叉树,然后通过遍历算法进行遍历。