1、概念:
- 从数据存储来看,数组存储方式和树的存储方式可以相互转换,即数组可以转换成树,树也可以转换成数组,如下图所示:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/53d89a73c75d984832ad9041e85071e8.png)
2、特点:
- 1、顺序二叉树通常考虑完全二叉树;
- 2、第n个元素的左子节点为 2*n+1;
- 3、第n个元素的右子节点为 2*n+2;
- 4、第n个元素的父节点为 (n-1)/2;
- 5、n:标识二叉树的第几个元素(按0开始编号,如上图所示)
3、示例代码:
class ArrayBinaryTree {
private int[] arr;
public ArrayBinaryTree(int[] arr) {
this.arr = arr;
}
public void preOrder() {
this.preOrder(0);
}
public void midOrder() {
this.midOrder(0);
}
public void postOrder() {
this.postOrder(0);
}
public void preOrder(int index) {
if (arr == null || arr.length == 0) {
System.out.println("数组为空");
return;
}
System.out.printf("%d\t", arr[index]);
if ((2 * index + 1) < arr.length) {
preOrder(2 * index + 1);
}
if ((2 * index + 2) < arr.length) {
preOrder(2 * index + 2);
}
}
public void midOrder(int index) {
if (arr == null || arr.length == 0) {
System.out.println("数组为空");
return;
}
if ((2 * index + 1) < arr.length) {
midOrder(2 * index + 1);
}
System.out.printf("%d\t", arr[index]);
if ((2 * index + 2) < arr.length) {
midOrder(2 * index + 2);
}
}
public void postOrder(int index) {
if (arr == null || arr.length == 0) {
System.out.println("数组为空");
return;
}
if ((2 * index + 1) < arr.length) {
postOrder(2 * index + 1);
}
if ((2 * index + 2) < arr.length) {
postOrder(2 * index + 2);
}
System.out.printf("%d\t", arr[index]);
}
}
public class ArrayBinaryTreeDemo {
public static void main(String[] args) {
int[] arr = {1, 2, 3, 4, 5, 6, 7};
ArrayBinaryTree arrayBinaryTree = new ArrayBinaryTree(arr);
System.out.println("前序遍历:");
arrayBinaryTree.preOrder();
System.out.println();
System.out.println("中序遍历:");
arrayBinaryTree.midOrder();
System.out.println();
System.out.println("后序遍历:");
arrayBinaryTree.postOrder();
System.out.println();
}
}