二叉树的三种递归遍历
#include <stdio.h> #include <stdlib.h>#define elemTpye inttypedef struct BitNode{ elemTpye data; struct BitNode *lchild,*rchild;}BitNode,*pBitNode;void CreateBTree(pBitNode b){ b->data=...
原创
2018-07-09 15:27:17 ·
577 阅读 ·
0 评论