随笔分类 - 数据结构 - 二叉树
摘要：typedef struct node { int data; struct node *lchild, *rchild; }bitnode, *bitree; bool search(bitree T, int x, bitree f, bitree *p){ // 查找应该插入的位置 if (!T) { *p = f; return ...
阅读全文
摘要：A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtree
阅读全文
