思路:利用递归,创建一个list,存放递归结果
/**
* 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 List<Integer> inorderTraversal(TreeNode root) {
ArrayList arraylist = new ArrayList<Integer>();
mid(arraylist,root);
return arraylist;
}
public void mid(ArrayList arraylist,TreeNode root){
if (root == null){
return ;
}
mid(arraylist,root.left);
arraylist.add(root.val);
mid(arraylist,root.right);
}
}
即:中间节点的位置
前序遍历:中间节点,左节点,右节点
中序遍历:左节点,中间节点,右节点
后序遍历:左节点,右节点,中间节点