{DATATYPE DATA; Struct BitNode * Lchild, * rChild;} BitNode, * rChild;
// Number of fallen nodes / * Author: Wadefelix renv * / # include #include #include "binarytree.h" int countleaf (bitree bt) {if (bt == null RETURN 0; if (bt-> lchild == null && bt-> rchild == null) Return 1; return (countleaf (bt-> lchild) countleaf (bt-> rchild);}
// Number of non-leaf nodes int countNotleaf (Bitree BT) {if (bt == null) Return 0; if (bt-> lchild == null && bt-> rchild == null) Return 0; Return (1 CountNotleaf (BT-> LCHILD) CountNotleaf (bt-> rchild);}
/ / Judgment is whether it is sorted binary tree #include #include #include "binarytree.h" int ipaixu (bitree b) {if (bt == null) Return 1; if (bt-> Lchild && (BT-> LCHILD-> DATA> BT-> DATA)) RETURN 0; if (bt-> rchild && (bt-> rchild-> data data)) Return 0; Returnu (ISPAIXU (BT -> LCHILD) && ispaixu (bt-> rchild);
