/**
* 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 {
List<Integer> res = new ArrayList<Integer>();
public List<Integer> preorderTraversal(TreeNode root) {
if(root != null){
preOrder(root);
}
return res;
}
public void preOrder(TreeNode treeNode){
res.add(treeNode.val);
if(treeNode.left != null){
preorderTraversal( treeNode.left);
}
if(treeNode.right != null){
preorderTraversal(treeNode.right);
}
}
}
结合了一下题解,以及因为有返回值,以前学的是没有返回值是直接打印的。所以修改了我之前学习的代码通过了leetCode题。