![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树
MyDreamingCode
Life is not a bed of roses.
展开
-
求二叉树结点的个数
#include<stdio.h>#include<stdlib.h>typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *lchild; struct BTNode *rchild;}BTNode,*BiTree;void createBiTree(BTNode *&B){ ElemType ch; scanf("%c",&ch); if(c.原创 2021-11-17 09:59:16 · 643 阅读 · 0 评论 -
后序非递归遍历二叉树(用栈来实现)
#include<stdio.h>#include<stdlib.h>#define MaxSize 50typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode,*BiTree;typedef struct Stack{ BTNode *data[MaxSize]; int tagArr[.原创 2021-11-16 23:54:03 · 831 阅读 · 0 评论 -
先序非递归遍历二叉树(用栈来实现)
#include<stdio.h>#include<stdlib.h>#define MaxSize 50typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode,*BiTree;typedef struct Stack{ BTNode *data[MaxSize]; int top;}S.原创 2021-11-16 21:25:51 · 612 阅读 · 0 评论 -
中序非递归遍历二叉树(用栈来实现)
#include<stdio.h>#include<stdlib.h>#define MaxSize 50typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode,*BiTree;typedef struct Stack{ BTNode *data[MaxSize]; int top;}S.原创 2021-11-16 21:10:44 · 979 阅读 · 0 评论 -
二叉树的层次遍历(用队列来实现)
#include<stdio.h>#include<stdlib.h>#define MaxSize 50typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode,*BiTree;typedef struct Queue{ BTNode *data[MaxSize]; //注意这里的data要.原创 2021-11-16 20:36:36 · 757 阅读 · 2 评论 -
统计二叉树中叶子结点个数
#include<stdio.h>#include<stdlib.h>typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode,*BiTree;//创建二叉树void createBTNode(BiTree &BT){ ElemType ch; scanf("%c",&ch);.原创 2021-11-16 17:11:06 · 3881 阅读 · 0 评论 -
二叉树的创建+先序、中序,后序遍历
#include<stdio.h>#include<stdlib.h>typedef char ElemType;typedef struct BTNode{ ElemType data; struct BTNode *left; struct BTNode *right;}BTNode;//创建二叉树void createBTNode(BTNode *&BT){ ElemType ch; scanf("%c",&ch); if(ch.原创 2021-11-16 16:22:45 · 2289 阅读 · 3 评论