/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public List<Integer> preorderTraversal(TreeNode root) { List<Integer> result = new ArrayList<Integer>(); traversalHelper(root, result); return result; } public void traversalHelper(TreeNode root, List<Integer> result){ if (root == null){ return; } result.add(root.val); traversalHelper(root.left, result); traversalHelper(root.right, result); } }
Binary Tree Preorder Traversal (Recursive solution)
最新推荐文章于 2022-11-29 02:00:43 发布