一、递归遍历
中序遍历
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public void inOrder(TreeNode root, List<Integer> list){
if(root == null)return;
inOrder(root.left,list);
list.add(root.val);
inOrder(root.right,list);
}
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
inOrder(root,list);
return list;
}
}
前序遍历
class Solution {
public void preOrder(TreeNode root,List<Integer> list){
if(root == null)return;
list.add(root.val);
preOrder(root.left,list);
preOrder(root.right,list);
}
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
preOrder(root,list);
return list;
}
}
后序遍历
class Solution {
public void postOrder(TreeNode root, List<Integer> list){
if(root == null)return;
postOrder(root.left,list);
postOrder(root.right,list);
list.add(root.val);
}
public List<Integer> postorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
postOrder(root,list);
return list;
}
}