LeetCode--Binary Tree Preorder Traversal
来源:互联网 发布:stc单片机官网 编辑:程序博客网 时间:2024/05/20 16:36
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?
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int> preorderTraversal(TreeNode *root) { vector<int> res; if(root==NULL) return res; preorderTraversal(root,res); return res; } void preorderTraversal(TreeNode *root, vector<int>& res) { if(root == NULL) return; res.push_back(root->val); preorderTraversal(root->left, res); preorderTraversal(root->right, res); }};
1 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
- getHibernateTemplate()和getSession()的区别
- 如何在ASP.NET中创建OpenID
- Underscore.js (1.7.0) 中文文档
- linux dd命令[用于制作U盘启动盘的神奇的命令]
- JAVASCRIPT严格模式
- LeetCode--Binary Tree Preorder Traversal
- 修改Android工程版本
- 条款26 尽可能延后变量定义出现的时间
- 《poi excel批量导入数据库 2003与2007兼容》使用说明
- Xcode6创建新项目后没有pch文件以及黑边问题
- mysql5.5设置字符编码
- Work Process Overview Fields
- 关于新手搭建PHP环境遇到的几个问题
- UCenter与Java Web部署对接