Leetcode Binary Tree Preorder Traversal
来源：互联网 发布：linux高级运维 编辑：程序博客网 时间：2024/06/08 07:53
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1 \ 2 / 3
return [1,2,3].
Note: Recursive solution is trivial, could you do it iteratively?
Difficulty: Medium
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public void helper(TreeNode root, List<Integer> res){ if(root == null) return; res.add(root.val); helper(root.left, res); helper(root.right, res); } public List<Integer> preorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<Integer>(); helper(root, res); return res; }} 0 0
- LeetCode Binary Tree Preorder Traversal
- 【LeetCode】Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- Leetcode Binary Tree Preorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- LeetCode:Binary Tree Preorder Traversal
- [LeetCode]Binary Tree Preorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- LeetCode | Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- LeetCode - Binary Tree Preorder Traversal
- LeetCode - Binary Tree Preorder Traversal
- 【LeetCode】Binary Tree Preorder Traversal
- [LeetCode]Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal - LeetCode
- [Leetcode] Binary Tree Preorder Traversal
- PKU四日游（信息科学夏令营）
- HDU 5761_2016 Multi-University Training Contest 3
- Leetcode Sum of Two Integers
- Leetcode Minimum Depth of Binary Tree
- Leetcode Word Ladder II
- Leetcode Binary Tree Preorder Traversal
- Leetcode Convert Sorted Array to Binary Search Tree
- Leetcode Missing Number
- Leetcode Fraction to Recurring Decimal
- Leetcode Rotate List
- typhon例子：cs，bufDataset(类似delphi的clientDataset)，josn解析器
- java反射覆写toString方法实现输出实体类属性值
- 动态加载碎片的简单用法
- vbox复制虚拟机的网络配置
