- 博客(2)
- 收藏
- 关注
RSS订阅原创 【ACM训练之旅】leetcode 100
100. Same Tree Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the sa
2016-10-23 17:43:09
573
原创 二叉树的先序、中序、后序的递归和非递归算法
/**二叉树的尝试 *测试数据是 ABC##DE#G##F### */ #include #include #define OK 1#define ERROR 0#define OVERFLOW -2#define StackInItSize 100#define INCREAMENT 10 typedef struct BiTNode //二叉树的结构体 {
2016-10-10 09:17:46
331
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人