数据结构
猛士骁将
这个作者很懒,什么都没留下…
展开
-
求二叉树中结点值为x的个数
int xNum(BTNode* bt, char x){ int lnum, rnum; if (bt == NULL) return 0; else { lnum = xNum(bt->lchild, x); rnum = xNum(bt->rchild, x); if (bt->data == x) return lnum + rnum + 1; else return lnum + rnum; }}原创 2020-08-13 09:25:34 · 2792 阅读 · 0 评论 -
求给定二叉树的结点数和叶子结点数以及双分支结点数
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include "createTree.h"using namespace std;int nodeNum(BTNode * bt){ int lnum = 0, rnum = 0; if (bt == NULL) return 0; else { lnum = nodeNum(bt->lchild); rnum = nodeNum(bt->rch.原创 2020-08-12 11:26:49 · 798 阅读 · 0 评论 -
求二叉树后序序列中第K(K>=1)个结点的值
#define _CRT_SECURE_NO_WARNINGS#include <iostream>#include "createTree.h"using namespace std;BTNode* findK(BTNode * bt, int x){ BTNode* l = NULL, * r = NULL; static int k = x; if (bt != NULL && k != 0) { l = findK(bt->lchild,.原创 2020-08-12 10:59:52 · 351 阅读 · 0 评论 -
求二叉树中序序列中第K(K>=1)个节点的值
#include <iostream>#include "createTree.h"using namespace std;BTNode* findK(BTNode* bt, int x)//返回第K个结点的地址{ BTNode* l = NULL, * r = NULL; static int k = x;//静态变量,只初始化一次 if (bt != NULL && k != 0) { l = findK(bt->lchi原创 2020-08-12 10:25:45 · 667 阅读 · 0 评论 -
求二叉树先序序列中的第K(K>=1)个节点的值
求二叉树先序序列中的第K(K>=1)个节点的值#include <iostream>#include "createTree.h"using namespace std;int k = 4;//全局变量存储k的值BTNode* findK(BTNode* bt){ BTNode* l = NULL, * r = NULL; if (bt == NULL) return NULL; else { k--; if (k != 0原创 2020-08-11 15:25:19 · 356 阅读 · 0 评论