java创建二叉树_java实现二叉树的创建及5种遍历方法(总结)

用java实现的数组创建二叉树以及递归先序遍历，递归中序遍历，递归后序遍历，非递归前序遍历，非递归中序遍历，非递归后序遍历，深度优先遍历，广度优先遍历8种遍历方式：

package myTest;

import java.util.ArrayList;

import java.util.LinkedList;

import java.util.List;

import java.util.Stack;

public class myClass {

public static void main(String[] args) {

// TODO Auto-generated method stub

myClass tree = new myClass();

int[] datas = new int[]{1,2,3,4,5,6,7,8,9};

List nodelist = new LinkedList<>();

tree.creatBinaryTree(datas, nodelist);

Node root = nodelist.get(0);

System.out.println("递归先序遍历：");

tree.preOrderTraversal(root);

System.out.println();

System.out.println("非递归先序遍历：");

tree.preOrderTraversalbyLoop(root);

System.out.println();

System.out.println("递归中序遍历：");

tree.inOrderTraversal(root);

System.out.println();

System.out.println("非递归中序遍历：");

tree.inOrderTraversalbyLoop(root);

System.out.println();

System.out.println("递归后序遍历：");

tree.postOrderTraversal(root);

System.out.println();

System.out.println("非递归后序遍历：");

tree.postOrderTraversalbyLoop(root);

System.out.println();

System.out.println("广度优先遍历：");

tree.bfs(root);

System.out.println();

System.out.println("深度优先遍历：");

List> rst = new ArrayList<>();

List list = new ArrayList<>();

tree.