c中的逻辑门仿真

Question

 struct gate
    {
        char name[10]; 
        int type; //Type of the gate : INPUT,AND, OR, NOT, FLIPFLOP
        int value;
        char inputname1[10];
        char inputname2[10];
        struct gate *input1;
        struct gate *input2;
    };

I've created a tree with a struct structure, but I can't find out how to calculate it in a recursive way, can you help?

int pre(struct gate *root)        //address of root node is pass
{
    if(root->input1->type==INPUT || root->input2->type==INPUT){
        if(root->type == OR){
            root->type = INPUT;
            return root->value = gateor(root->input1->value,root->input2->value);
        }
        if(root->type == AND){
            root->type = INPUT;
            return root->value = gateand(root->input1->value,root->input2->value);
        }
        if(root->type==NOT){
            root->type=INPUT;
            return root->value = gatenot(root->input1->value);
        }
        if(root->type == FLIPFLOP){
            root->type = INPUT;
            return root->value = gateflipflop(root->input1->value,0);
        }
    }

    pre(root->input1);
    pre(root->input2);

}

i can't think recursive,I was hoping it would work.

a,b,c,d is a struct but it only has value , type and name.
values are 1 and 0
gate values = -1;
I don't know if these values ​​are necessary.

Answer 1

Recursively you could solve it like this:

int pre (struct gate *root) {
    if (root->type == INPUT)
        return root->value; // This is the recursion end
    else if (root->type == OR) {
        return gateor(pre(root->input1), pre(root->input2)); // Recurse here
    } else if (root->type == AND) {
        return gateand(pre(root->input1), pre(root->input2));
    } // Same for the other operations
}

This should give you an idea how to solve your problem.