https://blog.youkuaiyun.com/Pato_ac7zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Pato_ac7/article/details/6852434https://blog.youkuaiyun.com/Pato_ac7/article/details/6852434Pato_ac7Sat, 08 Oct 2011 14:42:58 +0800https://blog.youkuaiyun.com/Pato_ac7/article/details/6838139https://blog.youkuaiyun.com/Pato_ac7/article/details/6838139Pato_ac7Fri, 30 Sep 2011 17:37:24 +0800https://blog.youkuaiyun.com/Pato_ac7/article/details/6837680https://blog.youkuaiyun.com/Pato_ac7/article/details/6837680Pato_ac7Fri, 30 Sep 2011 15:38:42 +0800https://blog.youkuaiyun.com/Pato_ac7/article/details/6180008https://blog.youkuaiyun.com/Pato_ac7/article/details/6180008Pato_ac7Fri, 11 Feb 2011 23:13:00 +0800https://blog.youkuaiyun.com/Pato_ac7/article/details/6105695https://blog.youkuaiyun.com/Pato_ac7/article/details/6105695Pato_ac7Wed, 29 Dec 2010 19:25:00 +0800#define MaxSize 100
 
typedef struct node{
int data;
node* lchild;
node* rchild;
}TNode;
 
void  preOrder(TNode *b)
{
TNode *stack[MaxSize], *p; 
int top = -1;
stack[++top] = b;
while(t]]>https://blog.youkuaiyun.com/Pato_ac7/article/details/6105525https://blog.youkuaiyun.com/Pato_ac7/article/details/6105525Pato_ac7Wed, 29 Dec 2010 17:34:00 +0800https://blog.youkuaiyun.com/Pato_ac7/article/details/6105364https://blog.youkuaiyun.com/Pato_ac7/article/details/6105364Pato_ac7Wed, 29 Dec 2010 16:40:00 +0800