查找二叉树的节点(某一值的节点)
#include <iostream>#include <stdio.h>#include <stdlib.h>struct BinaryTreeNode{char value;struct BinaryTreeNode *lchild, *rchild;};// 输入值依次是:a、b、#、#、c、#、#struct Bin...
·
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
struct BinaryTreeNode{
char value;
struct BinaryTreeNode *lchild, *rchild;
};
// 输入值依次是:a、b、#、#、c、#、#
struct BinaryTreeNode *creatBiTree() {
struct BinaryTreeNode *node;
char data;
std::cin>>data;
if (data == '#') {
node = NULL;
} else {
node = (struct BinaryTreeNode *)malloc(sizeof(struct BinaryTreeNode *));
node->value = data;
node->lchild = creatBiTree();
node->rchild = creatBiTree();
};
return node;
}
struct BinaryTreeNode * searchNode(struct BinaryTreeNode *node) {
struct BinaryTreeNode * endNode = NULL;
if (node == NULL) {
return NULL;
}
if (node->value == 'c') {
endNode = node;
} else {
if (endNode == NULL) {
endNode = searchNode(node->lchild);
}
if (endNode == NULL) {
endNode = searchNode(node->rchild);
}
}
return endNode;
}
int main(int argc, const char * argv[]) {
struct BinaryTreeNode *rootNode = creatBiTree();
struct BinaryTreeNode *endNode = searchNode(rootNode);
printf("%d", endNode->value);
return 0;
}

GitCode 天启AI是一款由 GitCode 团队打造的智能助手,基于先进的LLM(大语言模型)与多智能体 Agent 技术构建,致力于为用户提供高效、智能、多模态的创作与开发支持。它不仅支持自然语言对话,还具备处理文件、生成 PPT、撰写分析报告、开发 Web 应用等多项能力,真正做到“一句话,让 Al帮你完成复杂任务”。
更多推荐
所有评论(0)