问题描述:
Given the root of a binary tree, return the preorder traversal of its nodes’ values. 前序遍历
题目比较简单,直接上代码:
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> myList = new ArrayList<>();
helper(root, myList);
return myList;
}
public void helper(TreeNode root, List<Integer> myList){
if (root!=null){
myList.add(root.val);
helper(root.left, myList);
helper(root.right, myList);
}
}
}
时间复杂度: O(n)