LeetCode---Binary Tree Preorder Traversal
来源：互联网 发布：网络搭建公司 编辑：程序博客网 时间：2024/05/17 12:00
题目大意：给出一个二叉树，返回其前序遍历。
算法思想：
如果当前节点不空，将节点放入容器，然后递归遍历左右子树。
代码如下：
/** * 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> nodes; vector<int> preorderTraversal(TreeNode* root) { if(root!=NULL){ nodes.push_back(root->val); preorderTraversal(root->left); preorderTraversal(root->right); } return nodes; }}; 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
- Pjax
- 返回字符串中的第一个数字
- [DP]10271 - Chopsticks
- leetcode 284: Peeking Iterator
- Jquery的 性能优化小结
- LeetCode---Binary Tree Preorder Traversal
- JQuery选择器小结
- HTTP协议详解
- 如何让一个方块上下左右居中
- 让老版本IE支持HTML5
- LeetCode---Binary Tree Inorder Traversal
- git基本操作
- ecshop的修改版 ectouch 后台管理账号 暴露的漏洞 发送短信
- npm命令
