Leetcode Binary Tree Preorder Traversal
来源：互联网 发布：php extjs 编辑：程序博客网 时间：2024/06/07 05:32
题意：先序遍历树。
思路：DFS，先序遍历。
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int> re; vector<int> preorderTraversal(TreeNode* root) { dfs(root); return re; } void dfs(TreeNode* root) { if(root == NULL) return; re.push_back(root->val); dfs(root->left); dfs(root->right); return; }}; 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
- 电商数据分析基础指标体系
- Leetcode Binary Tree Right Side View
- ITer必知的几个网站
- 自定义schema文件。xml引入该规则。
- 按钮的显示及隐藏
- Leetcode Binary Tree Preorder Traversal
- Java开发中的23种设计模式详解(转)
- 2015携程JAVA工程师笔试题(基础却又没多少人做对的面向对象面试题)
- CSS3代码编写规范及注意要点
- 数据库扩展之索引添加
- H5 HTML代码编写规范及注意要点
- win7 rabbitMQ 安装配置命令（需配置环境变量）
- 2015异常问题解决方案经验总结（一） (转发)
- 一个执行计划异常变更的案例 - 外传之rolling invalidation
