415 binary tree (144. preorder traversal of binary tree, 145. postorder traversal of binary tree, 94. inorder traversal of binary tree)

144. Preorder traversal of two tree

class Solution
{
    
public:
	void preorder(TreeNode* root, vector<int>& res)
	{
    
		if (root == nullptr)	return;

		res.push_back(root->val);
		preorder(root->left, res);
		preorder(root->right, res);
	}
public:
	vector<int> preorderTraversal(TreeNode* root)
	{
    
		vector<int> res;

		preorder(root, res);
		return res;
	}
};

class Solution
{
    
	vector<int> res;
public:
	void preorder(TreeNode* root)
	{
    
		if (root == nullptr)	return;

		res.push_back(root->val);
		preorder(root->left);
		preorder(root->right);
	}
public:
	vector<int> preorderTraversal(TreeNode* root)
	{
    
		preorder(root);
		return res;
	}
};

145. Postorder traversal of binary trees

class Solution
{
    
	vector<int> res;
public:
	void preorder(TreeNode* root)
	{
    
		if (root == nullptr)	return;

		preorder(root->left);
		preorder(root->right);
		res.push_back(root->val);
	}
public:
	vector<int> postorderTraversal(TreeNode* root)
	{
    
		preorder(root);
		return res;
	}
};

94. Middle order traversal of binary trees

class Solution 
{
    
	vector<int> res;
public:
	void preorder(TreeNode* root)
	{
    
		if (root == nullptr)	return;

		preorder(root->left);
		res.push_back(root->val);
		preorder(root->right);
	}
public:
	vector<int> inorderTraversal(TreeNode* root)
	{
    
		preorder(root);
		return res;
	}
};