简单二叉树(BST)遍历和节点删除算法
#include <stdio.h>
#include <stdlib.h>
typedef struct bst_node
{
int data;
struct bst_node *lchild;
struct bst_node *rchild;
}bst_st,*bst_pt;
bst_pt creat_node(int data);
bst_pt insert_bst(bst_pt root,bst_pt newnode);
void pre_travel(bst.
原创
2020-08-08 17:14:27 ·
330 阅读 ·
0 评论