leetcode-gulag/94-binary-tree-inorder-traversal/soln.hpp

#include <bits/stdc++.h>

using namespace std;

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) {}
};
class Solution
{
public:
	vector<int> inorderTraversal(TreeNode *root);
	bool test(TreeNode *root, vector<int> answer);
};