题目:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree{1,#,2,3},
1 \ 2 / 3
return[1,3,2].
题意:
根据给定的二叉树,返回中序遍历的结点值
解题思路:
很简单,直接中序遍历,然后用个全局变量来添加这个值就行
代码:
private ArrayList<Integer> list = new ArrayList<Integer>();
public ArrayList<Integer> inorderTraversal(TreeNode root) {
getNode(root);
return list;
}
public void getNode(TreeNode root){
if(root == null) {
return;
}
getNode(root.left);
list.add(root.val);
getNode(root.right);
}