- 二叉树的中序遍历
/**
* 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) {
//递归写法
List<Integer> list1 = new ArrayList<Integer>();
TreeNode root1 = root;
inorder (root1, list1);
return list1 ;
}
public void inorder(TreeNode root1, List list1){
if(root1 == null){
return ;
}else{
inorder(root1.left,list1);
list1.add(root1.val);
inorder(root1.right,list1);
}
}
}
list相关知识点