Data Structure stack implementation (C version)

Familiar with the data structure is also a general basis

PostCode~~~

# Define maxsize 10
Typedef struct
{
Int data [maxsize];
Int top;
} Sqstack;

Sqstack sqt;
Int Total = 4;
Void initstack (sqstack & St)
{
St. Top =-1;
}

Int stackempty (sqstack st)
{
Return (St. Top =-1 );
}

Int push (sqstack & St, int X)
{
If (St. Top = MAXSIZE-1)
Return 0;
St. Top ++;
St. Data [st. Top] = X;
Return 1;
}

Int POP (sqstack & St, Int & X)
{
If (St. Top =-1)
Return 0;
X = ST. Data [st. Top];
St. Top --;
Return 1;
}

Int gettop (sqstack st)
{
Return st. Data [st. Top];
}

Void process (INT POs, int path [], int CURP)
{
Int m, I, X;
If (Pos <= total)
{
Push (sqt, POS );
Process (Pos + 1, path, CURP );
Pop (sqt, X );
}
If (! Stackempty (sqt ))
{
Pop (sqt, M );
Path [CURP] = m;
CURP ++;
Process (Pos, path, CURP );
Push (sqt, M );
}
If (Pos> total & stackempty (sqt ))
{
Printf ("");
For (I = 0; I <CURP; I ++)
Printf ("% d", path [I]);
Printf ("/N ");
}
}

 

Then let's evaluate this self-written code.

----------------------------------------

Poor compatibility and poor style ··~~~~