【LeetCode OJ】Binary Tree Preorder Traversal
2014-06-09 00:00
274 查看
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree
return
For example:
Given binary tree
{1,#,2,3},1 \ 2 / 3
return
[1,2,3].
/**
* 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) {
preOrder(root);
return list;
}
public List<Integer> list = new ArrayList<Integer>();
public void preOrder(TreeNode root){
if(root == null)return;
list.add(root.val);
preOrder(root.left);
preOrder(root.right);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode OJ --问题与解答 Binary Tree Preorder Traversal
- leetcode OJ -Binary Tree Preorder Traversal(2014.1.20)
- LeetCode OJ - Binary Tree Preorder Traversal
- LeetCode OJ:Construct Binary Tree from Preorder and Inorder Traversal
- 【LEETCODE OJ】Binary Tree Preorder Traversal
- LeetCode OJ 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode OJ：Construct Binary Tree from Preorder and Inorder Traversal（从前序以及中序遍历结果中构造二叉树）
- LeetCode OJ--Binary Tree Preorder Traversal
- 【LeetCode OJ】Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode OJ]Binary Tree Preorder Traversal
- LeetCode OJ 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode OJ：Binary Tree Preorder Traversal（前序遍历二叉树）
- LeetCode OJ - Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode OJ 之 Binary Tree Preorder Traversal （二叉树的前序遍历）
- LeetCode OJ:Binary Tree Preorder Traversal
- LeetCode OJ - Binary Tree Preorder Traversal
- [LeetCode OJ] Binary Tree Preorder Traversal 解题报告
- LeetCode OJ --问题与解答 Binary Tree Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal （给出前序中序求二叉树）
- 【LeetCode】-Construct Binary Tree from Preorder and Inorder Traversal