一、层序遍历
//层序遍历
public static void levelOrder(Node root){
if(root==null){
return;
}
//用队列来模拟
Queue<Node> queue=new LinkedList<>();
//先把根节点入队列
queue.offer(root);
while(!queue.isEmpty()){
//先打印根节点
Node cur=queue.poll();
System.out.print(cur.val+" ");
if(cur.left!=null){
//左子树
queue.offer(cur.left);
}
if(cur.right!=null){
//左子树
queue.offer(cur.right);
}
}
}
二、先序遍历
//先序遍历
public static void FirstOrder(Node root) {
if (root == null) {
return;
}
Stack<Node> stack = new Stack<>();
stack.