leetcode - Binary Tree Inorder Traversal
来源：互联网 发布：mint linux 编辑：程序博客网 时间：2024/06/10 15: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].
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */struct TreeNode{int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution {public: std::vector<int> inorderTraversal(TreeNode *root) {dfs(root);return res; }private:std::vector<int> res;void dfs(TreeNode *root){if(root != NULL){dfs(root->left);res.push_back(root->val);dfs(root->right);}}}; 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
- Java StringBuilder和StringBuffer的比较
- gdb/lldb 使用
- vs2012设置默认的全局include和lib
- leetcode - Unique Binary Search Trees II
- POJ 2318 TOYS(叉积+二分查找)
- leetcode - Binary Tree Inorder Traversal
- ListView高度设置
- 如何成为一名Top DevOps Engineer
- acdream1242 水BFS
- 新生感悟
- 企业视觉－大型电商（系统）高性能－用户视觉性能（１）
- Python串口功能实现
- 按钮制作技巧（css精灵效果）-高级版
- C# 枚举数和迭代器总结
