LEETCODE: Binary Tree Inorder Traversal
来源:互联网 发布:mac怎么连接打印机 编辑:程序博客网 时间:2024/05/23 02:04
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,3,2]
.
递归方法,教科书上的。好像还可以用栈来解决这个问题。
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: void traverse(TreeNode *root, vector<int> &results) { if(root == NULL) return; traverse(root->left, results); results.push_back(root->val); traverse(root->right, results); } vector<int> inorderTraversal(TreeNode *root) { vector<int> results; traverse(root, results); return results; }};
0 0
- LeetCode: Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- LeetCode : Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- 【leetcode】Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- [leetcode]Binary Tree Inorder Traversal
- LeetCode-Binary Tree Inorder Traversal
- Leetcode Binary Tree Inorder Traversal
- [leetcode] Binary Tree Inorder Traversal
- LeetCode - Binary Tree Inorder Traversal
- [LeetCode] Binary Tree Inorder Traversal
- LeetCode | Binary Tree Inorder Traversal
- C语言插入排序
- 黑马程序员----java反射详解
- 九度OJ—题目1031:xxx定律
- 配置Hadoop-2.4.0的HA+Federation+Yarn详细记录
- 标准C++中的string类的用法总结
- LEETCODE: Binary Tree Inorder Traversal
- 九度OJ—题目1050:完数
- 开源中国广州源创会分享
- 自定义组合控件
- 常用防反接电路
- Spring框架学习(二) 之 jar包
- Android系统中TouchEvent的传递流程以及相关函数返回值True和False对流程的影响
- 输入两个数,第一个数决定一个nXn的矩阵
- C语言结构体声明中冒号的使用(占位符) & C结构体的乱序初始化