二叉树的层序遍历
摘要:1 typedef struct TreeNode *BinTree; 2 typedef BinTree Position; 3 struct TreeNode{ 4 ElementType Data; 5 BinTree Left; 6 BinTree Right; 7 }; 8 BinTree BT; 9 void LevelOrder...
阅读全文
posted @
2017-02-09 20:43
chy89224
阅读(128)
推荐(0)
二叉树的中序、先序、后序遍历非递归遍历算法(使用堆栈,用循环实现)
摘要:1 typedef struct TreeNode *BinTree; 2 typedef BinTree Position; 3 struct TreeNode{ 4 ElementType Data; 5 BinTree Left; 6 BinTree Right; 7 }; 8 BinTree BT; 9 void InOrderTr...
阅读全文
posted @
2017-02-09 20:39
chy89224
阅读(334)
推荐(0)
二叉树的先序、中序、后序遍历
摘要:typedef struct TreeNode *BinTree; typedef BinTree Position; struct TreeNode{ ElementType Data; BinTree Left; BinTree Right; }; BinTree BT; //二叉树的遍历 void PreOrderTraversal(BinTree BT)//(1)先序遍历 ...
阅读全文
posted @
2017-02-05 04:03
chy89224
阅读(196)
推荐(0)
二叉树的存储结构
摘要:typedef struct TreeNode *BinTree; typedefBinTree Position; struct TreeNode{ ElementType Data; BinTree Left; BinTree Right; }; BinTree BT;
阅读全文
posted @
2017-02-05 04:01
chy89224
阅读(111)
推荐(0)
数据管理基本操作-查找
摘要:typedef struct LNode *List; struct LNode{ ElementType Element[MAXSIZE]; int Length; }; 方法1:顺序查找算法 int SequentialSearch(List Tb1,ElementType K)//(有"哨兵"
阅读全文
posted @
2017-02-04 04:08
chy89224
阅读(181)
推荐(0)