PreOrder Tree Algorithm(Binary List Tree)
2013-10-30 15:33
274 查看
void PreOrder(LinkBTNode T)
{
const int MaxSize=40;
int top=-1;
LinkBTNode st[MaxSize],p;
if(T!=NULL)
{
top++;st[top]=T;
while(top>-1)
{
p=st[top];top--;
printf("%d",p->data);
if (p->rchild!=NULL)
{
top++;st[top]=p->rchild;
}
if (p->lchild!=NULL)
{
top++;st[top]=p->lchild;
}
printf("\n");
}
}
}
void PreOrder(LinkBTNode b)
{
if (b!=NULL)
{
printf("%d\n",b->data);
PreOrder(b->lchild);
PreOrder(b->rchild);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Binary Tree Preorder, Inorder, Postorder Traversal,Flatten Binary Tree to Linked List
- FTPrep, 105 Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
- Binary Tree Preorder Traversal
- LeetCode #144 - Binary Tree Preorder Traversal - Medium
- leetcode 日经贴，Cpp code -Construct Binary Tree from Preorder and Inorder Traversal
- Binary Tree Preorder Traversal 二叉树的先序@LeetCode
- LeetCode:Binary Tree Preorder Traversal
- Leetcode: Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Preorder Traversal
- [LeetCode] Binary Tree Preorder Traversal
- [LeetCode 144] Binary Tree Preorder Traversal（迭代法）
- Leetcode #105 Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode144—Binary Tree Preorder Traversal
- 递归---Construct Binary Tree from Preorder and Inorder Traversal
- leetcode Binary Tree Preorder
- Construct Binary Tree from Preorder and Inorder Traversal - Leetcode
- LeetCode 解题报告 Binary Tree Preorder Traversal
- [Leetcode] Construct binary tree from preorder and inorder travesal 利用前序和中续遍历构造二叉树