Data-Structures-and-Algorithms/CPP/Leetcode/94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/Leetcode/94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.5 (4964 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 * int val;
 * TreeNode *left;
 * TreeNode *right;
 * TreeNode() : val(0), left(nullptr), right(nullptr) {}
 * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
*/
classSolution {
private:
voidprinter(TreeNode* root){
if(root==NULL) {return;}
printer(root->left);
 v.push_back(root->val);
printer(root->right);
 }

public:
 vector<int> v;
 vector<int> inorderTraversal(TreeNode* root) {
printer(root);
return v;
 }
};