stack.cpp

参照网上的例子改写的多叉树的读写程序

#include <assert.h>
#include <string.h>
#include "mystack.h"




void init_stack(struct mystack *stk)
{
    stk->ptr = 0;
}

void push_stack(struct mystack *stk, struct tree_node  data)
{
  assert(stk->ptr < MAXL);
  //stack->data[stack->ptr++] = data;
	
  strcpy(stk->data[stk->ptr].data,data.data);
  strcpy(stk->data[stk->ptr].value,data.value);
  stk->data[stk->ptr].flag = data.flag;
  stk->data[stk->ptr].firstchild = data.firstchild;
  stk->data[stk->ptr].nextsibling = data.nextsibling;
  stk->ptr++;

}

struct tree_node *pop_stack(struct mystack *stk)
{
  assert(stk->ptr > 0);
  return(&stk->data[--stk->ptr]);
}

struct tree_node  topOfstack(struct mystack *stk)
{
  assert(stk->ptr > 0);
  return(stk->data[stk->ptr - 1]);
}