Skip to content

Commit 14bdfda

Browse files
committed
add 94
1 parent 836330a commit 14bdfda

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed

94.binary-tree-inorder-traversal.cpp

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
/*
2+
* @lc app=leetcode id=94 lang=cpp
3+
*
4+
* [94] Binary Tree Inorder Traversal
5+
*/
6+
7+
// @lc code=start
8+
/**
9+
* Definition for a binary tree node.
10+
* struct TreeNode {
11+
* int val;
12+
* TreeNode *left;
13+
* TreeNode *right;
14+
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
15+
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
16+
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
17+
* };
18+
*/
19+
class Solution {
20+
public:
21+
vector<int> inorderTraversal(TreeNode* root) {
22+
vector<int> result;
23+
if (root!=NULL)
24+
{
25+
vector<int> left = inorderTraversal(root->left);
26+
vector<int> right = inorderTraversal(root->right);
27+
if (left.size()>0)result.insert(end(result), begin(left), end(left));
28+
result.push_back(root->val);
29+
if (right.size()>0)result.insert(end(result), begin(right), end(right));
30+
}
31+
return result;
32+
}
33+
};
34+
// @lc code=end
35+

0 commit comments

Comments
 (0)