二叉树的遍历,递归实现
- 先序遍历
public static void preOrder(TreeNode root){
if(root==null){
return;
}
System.out.print(root.val);
preOrder(root.left);
preOrder(root.right);
}
- 中序遍历
public static void inOrder(TreeNode root){
if(root==null){
return;
}
inOrder(root.left);
System.out.print(root.val);
inOrder(root.right);
}
- 后序遍历
public static void postOrder(TreeNode root){
if(root==null){
return;
}
postOrder(root.left);
postOrder(root.right);
System.out.print(root.val);
}