刚学C语言时理解性的写的2杈

左手的ㄟ右手 2022-08-20 12:15 139阅读 0赞

</pre><pre code_snippet_id="1589697" snippet_file_name="blog_20160226_2_7927179" name="code" class="cpp">#ifndef _SHU_H
    #define _SHU_H
    #define _CRT_SECURE_NO_WARNINGS
    #include <stdio.h>
    #include <stdlib.h>
    #include <malloc.h>
    #include <windows.h>
    
    typedef struct Node//树
    {
    	int data;
    	struct Node *you;
    	struct Node *zuo;
    }node,*N;
    typedef struct STACK
    {
    	N top;
    	struct STACK *base;
    }stack,*S;
    typedef struct List
    {
    	N  phad;
    	List *next;
    }list, *L;
    
    
    void initNode(N*p);//初始化结构树
    bool init_arr(N*p);
    void show_xianxu(N *p);
    void show_zhongxu(N *p);
    void huoxu(N*p);
    void chenci(N *p);
    void Deteledata(N *p);
    int find(N*p,int  num);
    void DeteleN(N**p);
    #endif

</pre><pre code_snippet_id="1589697" snippet_file_name="blog_20160226_4_3847979" name="code" class="cpp">

#include"<span style="font-family: Arial, Helvetica, sans-serif;">SHU.H</span><span style="font-family: Arial, Helvetica, sans-serif;">"</span>

#include "shu.h"
    
    static int tp = 0, tps = 0;
    
    S phad = NULL;
    L lis = NULL;
    L end = NULL;
    bool is_empty()
    {
    	return tp == 0;
    }
    void Push_stack(N p)
    {
    	if (phad == NULL)
    	{
    		phad = (S)malloc(sizeof(stack));
    		if (phad == NULL)
    			exit(0);
    		phad->base = NULL;
    		phad->top = p;
    		tp++;
    		return;
    	}
    	else
    	{
    		S p1 = (S)malloc(sizeof(stack));
    		if (p1 == NULL)
    			exit(0);
    		p1->top = p;
    		p1->base = phad;
    		phad = p1;
    		tp++;
    		return;
    	}
    }
    void Pop_stack()
    {
    	if (phad == NULL)
    		return;
    	if (phad->base == NULL)
    	{
    		free(phad);
    		phad == NULL;
    		tp--;
    		return;
    	}
    	else 
    	{
    		S p1 = phad;
    		phad = phad->base;
    		free(p1);
    		p1=NULL;
    		tp--;
    		return;
    	}
    }
    N Top_stack()
    {
    	
    		return phad->top;
    	
    }
    void initNode(N*p)
    {
    	*p = (N)malloc(sizeof(node));
    	(*p)->data = 0;
    	(*p)->you = NULL;
    	(*p)->zuo = NULL;
    }
    bool init_arr(N*p)
    {
    	if (*p == NULL)
    		return false;
    	if ((*p)->you == NULL && (*p)->zuo == NULL && (*p)->data == 0)
    	{
    		int value, i = 0, val = 0;
    		N p1 = *p;
    		while (1)
    		{
    			printf("请输入你需要的生成的2茶树节点数:");
    			fflush(stdin);
    			if (scanf("%d", &val) != 1)
    			{
    				printf("\n输入的不为数字，重新输入！");
    				system("cls");
    				continue;
    			}
    	test:	for (; i<val;i)
    			{
    				printf("\n输入第%d个数据", i + 1);
    				fflush(stdin);
    				if (scanf("%d", &value) != 1)
    				{
    					printf("\n输入的不为数字，重新输入！");
    					system("cls");
    					continue;
    				}
    				p1 = *p;
    				if (i == 0)
    				{
    					p1->data = value;
    					i++;
    					continue;
    				}
    		     	if (value <= (*p)->data)
    				{
    					while (true)
    					{
    				test1:	if (p1->you == NULL)
    						{
    							N p2 = (N)malloc(sizeof(node));
    							p2->data = value;
    							p2->you = NULL;
    							p2->zuo = NULL;
    							p1->you = p2;
    							i++;
    							goto test;
    						}
    						else if (value<=p1->data)
    						{
    							p1 = p1->you;
    						}
    						if (value>p1->data)
    						{
    							goto test2;
    						}
    					}
    				}
    	           else if (value > p1->data)
    				{
    					while (true)
    					{
    		  test2:		if (p1->zuo == NULL)
    						{
    							N p2 = (N)malloc(sizeof(node));
    							p2->data = value;
    							p2->you = NULL;
    							p2->zuo = NULL;
    							p1->zuo = p2;
    							i++;
    							goto test;
    						}
    						else if (value > p1->data)
    						{
    							p1 = p1->zuo;
    						}
    						if (value < p1->data)
    						{
    							goto test1;
    						}
    					}
    				}
    			}
    			return true;
    		}
    		
    	}
    	else
    	{
    		return false;
    	}
    }
    void show_xianxu(N *p)
    {
    	if (*p == NULL)
    		return;
    	N p1 = *p;
    	while (p1 != NULL || !is_empty())
    	{
    		if (p1 != NULL)
    		{
    			Push_stack(p1);
    			printf("%d  ", p1->data);
    			p1 = p1->you;
    		}
    		else
    		{
    			p1 = Top_stack();
    			Pop_stack();
    			p1 = p1->zuo;
    		}
    	}
    	if (is_empty())
    		printf("\n数据为空\n");
    }
    void show_zhongxu(N *p)
    {
    	if (*p == NULL)
    		return;
    	N p1 = *p;
    	while (p1 != NULL || !is_empty())
    	{
    		if (p1!= NULL)
    		{
    			Push_stack(p1);
    			p1 = p1->you;
    			continue;
    		}
    		else
    		{
    			p1 = Top_stack();
    			printf("%d  ", p1->data);
    			Pop_stack();
    			p1 = p1->zuo;
    		}
    	}
    }
    void huoxu(N *p)
    {
    	if (*p == NULL)
    		return;
    	N p1 = *p;
    	N p2 = NULL;
    	while (p1 != NULL || !is_empty())
    	{
    		if (p1 != NULL)
    		{
    			Push_stack(p1);
    			p1 = p1->you;
    			continue;
    		}
    		p1 = Top_stack();
    		if (p1->zuo == NULL||p1->zuo == p2)
    		{
    			printf("%d  ", p1->data);
    			p2 = p1;
    			Pop_stack();
    			p1 = NULL;
    		}
    		else
    		{
    			p1 = p1->zuo;
    		}
    	}
    }
    
    void Push_list(N p)
    {
    	if (lis == NULL)
    	{
    		lis = (L)malloc(sizeof(list));
    		end = lis;
    		lis->phad = p;
    		lis->next = NULL;
    		tps++;
    	}
    	else
    	{
    		L st = (L)malloc(sizeof(list));
    		st->next = NULL;
    		st->phad = p;
    		end->next = st;
    		end = st;
    		tps++;
    	}
    }
    void Pop_list()
    {
    	if (lis->next == NULL)
    	{
    		free(lis);
    		lis = end = NULL;
    		tps--;
    		return;
    	}
    	else
    	{
    		L s = lis;
    		lis = lis->next;
    		free(s);
    		s = NULL;
    		tps--;
    	}
    }
    bool empty_list()
    {
    	return tps == 0;
    }
    N Top_list()
    {
    	return lis->phad;
    }
    
    void Detele_list()
    {
    	if (lis == NULL)
    		return;
    	if (lis->next == NULL)
    	{
    		free(lis->phad);
    		lis->phad = NULL;
    		free(lis);
    		lis = end = NULL;
    		tps--;
    		return;
    	}
    	else
    	{
    		L s = lis;
    		lis = lis->next;
    		free(s->phad);
    		s->phad = NULL;
    		free(s);
    		s = NULL;
    		tps--;
    		return;
    	}
    }
    void chenci(N *p)
    {
    	if (*p == NULL)
    		return;
    	N p1 = *p;
    	Push_list(p1);
    	while (p1 != NULL || !empty_list())
    	{
    		p1 = Top_list();
    		printf("%d  ", p1->data);
    		if (p1->you != NULL)
    		{
    			Push_list(p1->you);
    		}
    		if (p1->zuo != NULL)
    		{
    			Push_list(p1->zuo);
    		}
    		
    		Pop_list();
    		p1 = NULL;
    	}
    }
    
    
    void Deteledata(N *p)
    {
    	if (*p == NULL)
    		return;
    	N p1 = *p;
    	Push_list(p1);
    	while (p1 != NULL || !empty_list())
    	{
    		p1 = Top_list();
    		if (p1->you != NULL)
    			Push_list(p1->you);
    		if (p1->zuo != NULL)
    			Push_list(p1->zuo);
    		Detele_list();
    		p1 = NULL;
    	}
    	if (empty_list())
    	{
    		*p = NULL;
    	}
    
    }
    int find(N *p, int num)
    {
    	if (*p == NULL)
    	{
    		return 0;
    	}
    	N p1 = *p;
    	if (*p != NULL)
    	{
    test1:	if (num < p1->data)
    		{
    			while (p1 != NULL&&num < p1->data)
    			{
    				p1 = p1->you;
    			}
    			if (p1 != NULL)
    			{
    				if (num == p1->data)
    				{
    					return p1->data;
    				}
    				else
    				{
    					goto test2;
    				}
    			}
    			else
    			{
    				return 0;
    			}
    		}
    		else if (num == p1->data)
    			return p1->data;
            else 
    		{
    	test2:	if (num > p1->data)
    			{
    
    				while (p1!=NULL&&num > p1->data)
    				{
    					p1 = p1->zuo;
    				}
    				if (p1 != NULL)
    				{
    					if (num == p1->data)
    						return p1->data;
    					else
    						goto test1;
    				}
    				else
    					return 0;
    			}
    		}
    	}
    }
    
    void DeteleN(N**p)
    {
    	free(*p);
    	*p=NULL;
    }

\#main

#include "shu.h"
    
    
    void main()
    {
    	N *p=(N*)malloc(sizeof(node*));
    	initNode(p);
    
    	if (!init_arr(p))
    		exit(0);
    	puts("\n先序遍历:");
    	show_xianxu(p);
    	puts("\n中序遍历");
    	show_zhongxu(p);
    	puts("\n后续遍历:");
    	huoxu(p);
    	puts("\n层次遍历\n");
    	chenci(p);
    	puts("\n清空\n");
    	int num = find(p, 30);
    	printf("查找数据%d ", num);
    	Deteledata(p);
    	
    	
    	DeteleN(&p);
    
    	system("pause");
    }

学C一个月的时候 就1一个 理解错了 删除一个误以为是删除一个节点的全部 败笔