leetcode 日经贴，Cpp code -Binary Tree Preorder Traversal
来源：互联网 发布：达索plm软件名字 编辑：程序博客网 时间：2024/06/05 23:05
Binary Tree Preorder Traversal
/** * 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> preorderTraversal(TreeNode* root) { vector<int> preorder; stack<TreeNode*> st; while (root) { preorder.push_back(root->val); st.push(root); root = root->left; } while (!st.empty()) { root = st.top()->right; st.pop(); while (root) { preorder.push_back(root->val); st.push(root); root = root->left; } } return preorder; }}; 0 0
- leetcode 日经贴，Cpp code -Binary Tree Preorder Traversal
- leetcode 日经贴，Cpp code -Construct Binary Tree from Preorder and Inorder Traversal
- leetcode 日经贴，Cpp code -Binary Tree Postorder Traversal
- leetcode 日经贴，Cpp code -Binary Tree Inorder Traversal
- leetcode 日经贴，Cpp code -Binary Tree Level Order Traversal
- leetcode 日经贴，Cpp code -Binary Tree Zigzag Level Order Traversal
- leetcode 日经贴，Cpp code -Binary Tree Level Order Traversal II
- Leetcode 144. Binary Tree Preorder Traversal (Medium) (cpp)
- 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
- 栈的实现
- 避免频繁输入sudo，给普通用户提供root权限，并只需提供自己的密码
- 日期操作类
- 《数学之美》笔记
- 代码布局问题
- leetcode 日经贴，Cpp code -Binary Tree Preorder Traversal
- Java冒泡排序BubbleSort
- Fragment的概念与使用(二）--构建灵活的Android应用UI
- Spring学习8-Spring事务管理（注解式声明事务管理）
- Swift2学习：Swift概览6-协议和扩展
- HDOJ1342lotto(DFS)
- 超链接下载，文件含中文名如何处理（服务器为tomcat）
- fragmentActivity布局文件报错Error inflating class fragment
- 【Python】【3】Python之——从HelloWorld开始（四则运算，简单函数以及简单模块）
