二叉树类
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
前序:
public class Solution {
private List<Integer> list=new ArrayList<>();
public List<Integer> preorderTraversal(TreeNode root) {
preOrder(root);
return list;
}
public void preOrder(TreeNode root) {
if (root == null) {
return;
}
list.add(root.val);
preOrder(root.left);
preOrder(root.right);
}
}
中序:
public class Solution{
private List<Integer> list = new ArrayList<>();
public List<Integer> inorderTraversal(TreeNode root) {
inOrder(root);
return list;
}
private void inOrder(TreeNode root) {
if (root==null)return;
inOrder(root.left);
list.add(root.val);
inOrder(root.right);
}
}
后序:
public class Solution {
private List<Integer> list = new ArrayList<>();
public List<Integer> postorderTraversal(TreeNode root) {
postOrder(root);
return list;
}
private void postOrder(TreeNode root) {
if (root==null)return;
postOrder(root.left);
postOrder(root.right);
list.add(root.val);
}
}