遍历思路:左根右,第二次经过该节点时进行打印,即左边回溯时
首先第一一棵二叉树,如图
中序遍历的压栈和出栈逻辑。节点1压入栈中,不能打印节点1,接着压入节点2也不能打印,此时压入节点4、压入节点4的左右空节点、随后弹出栈,此时回溯到节点4,是第二次出现需要打印继续回溯到节点2,此时打印节点2,然后把节点5压入栈中,依次类推。
最终的一个遍历输出顺序应为
算法代码实现:
节点类定义
package com.hx;
/**
* 二叉树节点对象类
*/
public class TreeNode {
public TreeNode left;//左节点
public TreeNode right;//右节点
public int val; //节点值
public int deep; //树深度
public TreeNode(TreeNode left, TreeNode right) {
this.left = left;
this.right = right;
}
public TreeNode(int val, TreeNode left, TreeNode right) {
this.left = left;
this.right = right;
this.val = val;
}
}
算法实现类
package com.hx;
public class BinaryTree {
/**
* 二叉树遍历-中序遍历递归
* @param root
*/
public static void preorderByCenter(TreeNode root) {
if(root == null) {
return;
}
preorderByCenter(root.left);
System.out.println(root.val);//第二次成为栈顶的元素即打印
preorderByCenter(root.right);
}
public static void main(String[] args) {
TreeNode node7 = new TreeNode(7,null, null);
TreeNode node6 = new TreeNode(6,null, null);
TreeNode node5 = new TreeNode(5,node6, node7);
TreeNode node4 = new TreeNode(4,null, null);
TreeNode node3 = new TreeNode(3,null, null);
TreeNode node2 = new TreeNode(2,node4, node5);
TreeNode node1 = new TreeNode(1,node2, node3);
preorderByCenter(node1);
}
}
执行结果