C++ 将偶数压入偶数栈，将奇数压入奇数栈

Question

I'm trying to verify if the current element is even and push it into an even stack and if not to push it into an odd stack without using the library. I want to push 6 into the even stack delete it from the first stack using pop and so on

| Odd stack| First Stack | | Even stack| 
| -------- |     4       | |     6     |
|    5     |     12      | |     12    |
|    3     |     3       | |     4     |
|          |     5       | |           |
|          |     6       | |           |

#include <conio.h>
#include <fstream>
#include <iostream>

using namespace std;

struct nod {
    int info;
    nod* next;
};

nod* l;
int n;

nod* push(int info, nod* l) {
    nod* aux;
    aux = new nod;
    aux->info = info;
    aux->next = l;
    return aux;
}

nod* pop(nod* l) {
    nod *aux1, *aux2;
    if (l != NULL) {
        aux1 = l;
        aux2 = l->next;
        cout << "\nVoi sterge nodul care contine:" << aux1->info << endl;
        delete aux1;
        return aux2;
    } else {
        cout << "\n Stiva este goala. Nu am ce sa sterg." << endl;
        return NULL;
    }
}

// creating stack
void creare_stiva() {
    nod* a;
    int info;
    ifstream f("in.txt");
    f >> n;
    for (int i = 0; i < n; i++) {
        f >> info;
        l = push(info, l);
    }
}
// displaying stack
void afisare_stiva(nod* a) {
    a = l;
    if (a == NULL)
        cout << "Lista nu exista";
    else {
        cout << "\nElementele listei sunt: ";
        while (a) {
            cout << a->info << " | ";
            a = a->next;
        }
    }
}

int main() {
    creare_stiva();
    afisare_stiva(l);
    cout << endl;
    return 0;
}

I tried testing if the element is odd or even but i don't know how to push it in an even stack and then delete it How do I create 2 stacks, one even and one odd to then put the elements from the first stack and then delete them as I go?

void testing() {
    int info;
    while (l) {
        if (l -> info % 2 == 0) {

            l = push(info, l)
            l = l -> next;
        } else {
            l = l -> next;
        }
    }
}

Answer 1

First, create 2 stacks and name them like oddStack and evenStack. Then check if the number is odd or even. If the number is even, push it to evenStack; if the number is odd, push it to oddStack.