查看会员资料
用 户 名:闫****
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
include
- 用一个结构体存储每个节点,每个结构体包括一个char 和指向左右孩子的指针,每次扫进来它自身的char和i, 如果i为偶则放进左子树,否则放进右子树。然后就是利用递归前序遍历此树-Structure with a store on each node, each structure includes a char and a pointer to the children about each sweep into its own char and i, for even if i was in