【C++代码】二叉树中序递归遍历

## **二叉树中序递归遍历**

void InOrder(TreeNode* root, vector & temp)
{

	if (root)
	{
		
		if (root->left)
		{
			InOrder_pre(root->left, temp);
		}
		temp.push_back(root->val);
		if (root->left)
		{
			InOrder_pre(root->right, temp);
		}
	}
	return ;
}
vector InOrder(TreeNode* root)
{
	vector temp;
	if (!root) return temp;
	InOrder(root, temp);
	return temp;
}