- 博客(5)
- 收藏
- 关注
RSS订阅原创 已知先序+中序构造二叉树，已知后序+中序构造二叉树
#include<stdio.h>#include<stdlib.h>typedef struct Bitree{ char data; struct Bitree *lchild; struct Bitree *rchild;}Bitree,*Bi;void PreOrder(Bitree *p);void MidOrder(Bitree *p);void PostOrder(Bitree *p);void print(Bitree *Troot); vo.
2021-01-20 11:03:00
171
原创 第四次 交换节点
/*ÊäÈëÎÞÐòµÄÔªËØ£¬·Ö±ð½¨Á¢Á½¸öÓÐ3¸öÔªËؽáµãµÄÓÐÐòµ¥Á´±í£¨ÎÞÍ·½áµã££¨ÏÔʾÅÅÐòºóµÄÁ´±í££¬½»»»Á½¸öµ¥Á´±íµÄµÚ¶þ¸ö½áµã£¨×¢Òâ²»ÄܲÉÈ¡Ö±½Ó¸³ÖµµÄ·½Ê½£¬Òª½øÐнáµãµÄÒƶ¯££¬×îºóÏÔʾÁ´±íÖÐÔªËØ¡£ÑùÀýÊäÈë6 4 52 1 3ÑùÀýÊä³ö4 5 61 2 34 2 61 5 3*/#include<s
2021-01-20 10:48:37
192
原创 c++后序建立二叉树，前序输出
#include <iostream>#include <cstdlib>#include <stack>using namespace std;typedef struct TreeNode *Tree;typedef char ElementType;stack<char> sta;struct TreeNode { ElementType Element; Tree Left; Tree Right;};
2021-01-20 10:29:30
205
原创 链表调通
#include<stdio.h>#include<string.h>#include<malloc.h>#include<stdlib.h>typedef struct Node{ char data; struct Node *next;}Node,*Linklist;Linklist Creat(Linklist L){ char ch; int flag = 1; Linklist s, r; L = (Node*)ma
2021-01-20 09:38:57
96
原创 树-线索化-我就不信搜不到
#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct Node{ char data; struct Node *LChild; struct Node *RChild;}BiTNode, *BiTree;int depth = 0;BiTree Creat(BiTree *bt){ char ch; ch = getchar(); if(ch =='.')
2021-01-06 00:11:11
156
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人