二叉树中序遍历(递归)

#include <iostream>
using namespace std;

struct Node
{
    int value;
    Node *left;
    Node *right;
};

void  inorderTraverse(Node *root)
{
    if (NULL == root)
    {
        return;
    }
    
    inorderTraverse(root->left);
    cout << root->value << " ";
    inorderTraverse(root->right);
}