1.前序遍历
public static void preOrderTraversal(Node root){
if(root==null){
return;
}
System.out.print(root.val+" ");
preOrderTraversal(root.left);
preOrderTraversal(root.right);
}
2.中序遍历
public static void inOrderTraversal(Node root){
if(root==null){
return;
}
inOrderTraversal(root.left);
System.out.print(root.val+" ");
inOrderTraversal(root.left);
}
private static List<Character> inorderReturnList(Node root){
List<Character> list=new ArrayList<>();
if(root==null){
return list;
}
list.addAll(inorderReturnList(root.left));
list.add(root.val);
list.addAll(inorderReturnList(root.right));
return list;
}
3.后序遍历
public static void postOrderTraversal(Node root){
if(root=&#