编写一个程序，使用堆栈将表达式 a b + c d e + * * 转换为表达式树

说明我不知道如何完成这项任务....但我只是创建了一个树并输入值。任何人都可以帮我完成这项任务...堆栈也是节点类型，我们必须推送像 ab+ 这样的运算符的值，所以我们将 a 作为节点推送，然后 b 作为节点，当 + 到来时，我们制作一棵树，a 和 b 将是它的叶节点。

.法典

#include<iostream>
using namespace std;
class Node{
public:
    int data;
    Node *left;
    Node *right;
    Node()
    {
        data = 0;
        left = NULL;
        right = NULL;
    }
};
class Tree
{
    Node *root;
    void insert(int d, Node *node)
    {
        if (d < node->data)
        {
            if (node->left == NULL)
            {
                Node *leaf = new Node();
                leaf->data = d;
                node->left = leaf;
            }
            else
            {
                insert(d, node->left);
            }
        }
        else
        {
            if (node->right == NULL)
            {
                Node *leaf = new Node();
                leaf->data = d;
                node->right = leaf;
            }
            else
            {
                insert(d, node->right);
            }
        }
    }
    void inOrderDisplay(Node *subRoot)
    {
        if (subRoot != NULL)
        {
            inOrderDisplay(subRoot->left);
            cout << subRoot->data << "  ";
            inOrderDisplay(subRoot->right);
        }
    }
    void postOrderDisplay(Node *subRoot)
    {
        if (subRoot != NULL)
        {
            postOrderDisplay(subRoot->left);
            postOrderDisplay(subRoot->right);
            cout << subRoot->data << "  ";
        }
    }
    void preOrderDisplay(Node *subRoot)
    {
        if (subRoot != NULL)
        {
            cout << subRoot->data << "  ";
            preOrderDisplay(subRoot->left);
            preOrderDisplay(subRoot->right);
        }
    }
    void deleteSubtree(Node *subRoot)
    {
        if (subRoot != NULL)
        {
            deleteSubtree(subRoot->left);
            deleteSubtree(subRoot->right);
            cout << "ndeleting: " << subRoot->data;
            delete subRoot;
            subRoot = NULL;
        }
    }
public:
    Tree()
    {
        root = NULL;
    }
    ~Tree()
    {
        deleteAll();
    }
    void insert(int d)
    {
        if (root == NULL)
        {
            Node *leaf = new Node();
            leaf->data = d;
            root = leaf;
        }
        else
        {
            insert(d, root);
        }
    }
    void inOrderDisplay()
    {
        inOrderDisplay(root);
    }
    void postOrderDisplay()
    {
        postOrderDisplay(root);
    }
    void preOrderDisplay()
    {
        preOrderDisplay(root);
    }
    void deleteAll()
    {
        deleteSubtree(root);
    }
};

.主类：

#include<iostream>
#include"task1.h"
using namespace std;
void main()
{
    Tree tree;
    tree.insert(10);
    tree.insert(6);
    tree.insert(14);
    tree.insert(5);
    tree.insert(8);
    tree.insert(11);
    tree.insert(18);
    cout << endl;
    system("pause");
    //tree.deleteAll();
}