二叉树 中序遍历 python_二叉树的前序中序后序遍历(java代码)

之前写了二叉树的深度和广度优先遍历,这次来实现下二叉树的前序中序后序遍历,分别用递归和栈每个都实现了下.

构造的二叉树形状

import java.util.*;public class traversal {public static void main(String[] args) {
List<Integer> list=new ArrayList<>();//构造二叉树
TreeNode treeNode6=new TreeNode(2,null,null);
TreeNode treeNode5=new TreeNode(1,null,null);
TreeNode treeNode4=new TreeNode(7,null,null);
TreeNode treeNode3=new TreeNode(6,treeNode5,treeNode6);
TreeNode treeNode2=new TreeNode(5,treeNode4,null);
TreeNode root=new TreeNode(3,treeNode2,treeNode3);
list = recursivePreoderTraversal(root);
System.out.println("递归 前序 遍历:"+list.toString());
list = NotRecursivePreoderTraversal(root);
System.out.println("非递归前序遍历:"+list.toString());
list = recursiveInoderTraversal(root);
System.out.println("递归 中序 遍历:"+list.toString());
list = NotRecursiveInoderTraversal(root);
System.out.println("非递归中序遍历:"+list.toString());
list = recursivePostoderTraversal(root);
System.out.println("递归 后序 遍历:"+list.toString());
list = NotRecursivePostoderTraversal(root);
System.out.println("非递归后序遍历:"+list.toString());
}//递归前序遍历public static List<Integer> recursivePreoderTraversal(TreeNode root){
List<Integer> list=new ArrayList<>();recursivePreoderTraverse(root,list);return list;
}public static void recursivePreoderTraverse(TreeNode root,List<Integer> list) {if(root==null) return;
list.add(root.val);recursivePreoderTraverse(root.left,list);recursivePreoderTraverse(root.right,list);
}//非递归前序遍历public static List<Integer> NotRecursivePreoderTraversal(TreeNode root){if(root == null) return null;
List<Integer> list=new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();while(!stack.isEmpty() || root != null){while(root != null){
list.add(root.val);
stack.push(root);
root = root.left;
}if(!stack.isEmpty()){
TreeNode tNode = stack.pop();
root = tNode.right;
}
}return list;
}//递归中序遍历public static List<Integer> recursiveInoderTraversal(TreeNode root){
List<Integer> list=new ArrayList<>();recursiveInoderTraverse(root,list);return list;
}public static void recursiveInoderTraverse(TreeNode root,List<Integer> list) {if(root==null) return;recursiveInoderTraverse(root.left,list);
list.add(root.val);recursiveInoderTraverse(root.right,list);
}//非递归中序遍历public static List<Integer> NotRecursiveInoderTraversal(TreeNode root){if(root == null) return null;
List<Integer> list=new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();while(!stack.isEmpty() || root != null){while(root != null){
stack.push(root);
root = root.left;
}if(!stack.isEmpty()){
TreeNode tNode = stack.pop();
list.add(tNode.val);
root = tNode.right;
}
}return list;
}//递归后序遍历public static List<Integer> recursivePostoderTraversal(TreeNode root){
List<Integer> list=new ArrayList<>();recursivePostoderTraverse(root,list);return list;
}public static void recursivePostoderTraverse(TreeNode root,List<Integer> list) {if(root==null) return;recursivePostoderTraverse(root.left,list);recursivePostoderTraverse(root.right,list);
list.add(root.val);
}//非递归后序遍历public static List<Integer> NotRecursivePostoderTraversal(TreeNode root){if(root == null) return null;
List<Integer> list=new ArrayList<>();
Stack<TreeNode> stack = new Stack<>();
TreeNode temp = null;while(!stack.isEmpty() || root != null){while(root != null){
stack.push(root);
root = root.left;
}if(!stack.isEmpty()){
TreeNode tNode = stack.pop();if(tNode.right == null || temp == tNode.right){
list.add(tNode.val);
temp = tNode;
}else{
stack.push(tNode);
root = tNode.right;
}
}
}return list;
}
}

输出结果: