leetcode - Binary Tree Preorder Traversal
来源:互联网 发布:ipad淘宝卖家版下载 编辑:程序博客网 时间:2024/05/23 19:20
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) {} * }; *///BinTree的先序遍历struct TreeNode{int val;TreeNode *left;TreeNode *right;TreeNode(int x): val(x), left(NULL),right(NULL) {}}class Solution {public:std::vector<int> preorderTraversal(TreeNode *root) {std::vector<int> vec;BinTree(root,vec);return vec;}void BinTree(TreeNode *root, std::vector<int> &vec){if(root != NULL){vec.push_back(root->vel);BinTree(root->left,vec);BinTree(root->right,vec);}}};
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
- 解决前台传入汉字在后台解析时会乱码
- Java 正则表达式详解
- 旗舰智能新机扎堆发布 高度同质化倒逼厂商微创
- C++根据来电号码显示人名
- HttpURLconnection详解
- leetcode - Binary Tree Preorder Traversal
- awakeFromNib可以用来干什么?
- 编程算法 - 两个升序列的相同元素 代码(C)
- ASP.NET MVC + EF 利用存储过程读取大数据,1亿数据测试很OK
- Mysql,Oracle,Java数据类型对应
- 状态压缩 之 UVA 10944 - Nuts for nuts..
- C语言运算符的优先级与结合性
- SQL SERVER CLR UrlDecode
- Android Fragments详解一:概念