Leetcode 94 Binary Tree Inorder Traversal
来源:互联网 发布:mac装不了软件说版本低 编辑:程序博客网 时间:2024/06/05 08:32
Q:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
A:
/**
* 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> result;
void dfs(TreeNode *p)
{
if(p->left!=NULL){
dfs(p->left);
}
result.push_back(p->val);
if(p->right!=NULL) {
dfs(p->right);
}
return;
}
vector<int> inorderTraversal(TreeNode* root) {
TreeNode * head = root;
result.clear();
if(head!=NULL){
dfs(head);
}
return result;
}
};
- [leetcode 94] Binary Tree Inorder Traversal
- Leetcode NO.94 Binary Tree Inorder Traversal
- leetcode-94 Binary Tree Inorder Traversal
- leetcode || 94、Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal - LeetCode 94
- Leetcode[94]-Binary Tree Inorder Traversal
- leetcode(94):Binary Tree Inorder Traversal
- leetcode-94-Binary Tree Inorder Traversal
- Leetcode 94 Binary Tree Inorder Traversal
- leetcode[94]:Binary Tree Inorder Traversal
- LeetCode(94) Binary Tree Inorder Traversal
- Leetcode # 94 Binary Tree Inorder Traversal
- leetcode 94: Binary Tree Inorder Traversal
- [leetcode-94]Binary Tree Inorder Traversal(c++)
- leetcode-94:Binary Tree Inorder Traversal (Java)
- 【LeetCode】(94)Binary Tree Inorder Traversal(Easy)
- leetcode: (94) Binary Tree Inorder Traversal
- leetCode #94 Binary Tree Inorder Traversal
- java保留两位小数及getBytes用法
- react-redux学习笔记-1-react
- 星星评论
- MongoDB常用命令汇总之数据库常用命令。
- sort函数的第三个参数cmp
- Leetcode 94 Binary Tree Inorder Traversal
- 文本样式
- 可并堆,离散优化以及HASH表,线段树总结
- 变换
- [BZOJ 2429] 聪明的猴子 Kruskal+贪心
- Mysql 批量插入 事务插入 性能对比
- sql多表查询分组最大值
- list容器2
- 浅谈数位DP