LeetCode--Binary Tree Inorder Traversal
来源：互联网 发布：字体预览软件 编辑：程序博客网 时间：2024/06/01 22:27
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].
Note: Recursive solution is trivial, could you do it iteratively?
confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: vector<int> inorderTraversal(TreeNode *root) { vector<int> res;get_res(root,res);return res; }void get_res(TreeNode* x,vector<int>& res){if(x == NULL)return;get_res(x->left,res);res.push_back(x->val);get_res(x->right,res);}}; 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
- maven 常用命令goal
- Thinkpad T440p安装Linux的种种问题
- java笔记——数据类型
- 1091. Acute Stroke (30)
- 简单取出字符串中的重复字符
- LeetCode--Binary Tree Inorder Traversal
- Android Asynctask与Handler的比较，优缺点区别，Asynctask源码
- 使用css3的appearance改变元素样式
- 点在多边形内算法——判断一个点是否在一个复杂多边形的内部
- Java语言基础下
- 选择相册中的图片，并获取图片的path 解决codova 华为P6选取相册的问题(试过很多，用此方案解决)
- 《Zabbix监控系统深度实践》
- ConcurrentHashMap之实现细节
- 《卫报》分阶儿童阅读好书单 5-7
