十进制转十六进制(链栈).cpp

实现了循环便利一棵树

//程序运行成功。
#define OVERFLOW -2
#include <stdio.h>
#include <stdlib.h>
typedef struct Stacknod { int data;
                          struct Stacknod *next;
						} LinkStack;

void main()
{   void PushLstack(LinkStack *&top, int x);
    void PopLstack(LinkStack *&top, int &e);
	LinkStack *top=NULL; unsigned n; int e; char c;
	printf("请输入一个非负的十进制整数:\n");
    scanf ("%u", &n);
	while(n)
	{ PushLstack(top, n%16); /*将整数对16取余后的结果入栈*/
      n=n/16; /*将整数对16整除*/
	} 
    printf("转化成十六进制数为:\n");
	while(!top==NULL) /*栈非空*/
	{ PopLstack(top, e); /*将栈顶元素弹出*/
	  switch (e) 
	  {		case 10:
				c='A';printf("%c", c);break;
			case 11:
				c='B';printf("%c", c);break;
			case 12:
				c='C';printf("%c", c);break;
			case 13:
				c='D';printf("%c", c);break;
			case 14:
				c='E';printf("%c", c);break;
			case 15:
				c='F';printf("%c", c);break;
			default:
				printf("%d", e);break;
	  }
	}
    printf("\n");
}

void PushLstack(LinkStack *&top, int x)
{ 	LinkStack *p; /*将元素x 压入链栈中*/
    if(!(p=(LinkStack *)malloc(sizeof(LinkStack))))
       printf("分配空间失败\n"),exit(OVERFLOW); 
    p->data=x; p->next=top; top=p;
}

void PopLstack(LinkStack *&top, int &e)
{ 	/*从链栈top中删除栈顶元素*/
    LinkStack *p;
    if (top==NULL) printf("这是一个空栈\n"),exit(OVERFLOW);
    p=top; top=top->next;
    e=p->data; 
	free(p);
}