- void InorderTraversal( BinTree BT )
- {
- if( BT ) {
- InorderTraversal( BT->Left );
-
- printf("%d ", BT->Data);
- InorderTraversal( BT->Right );
- }
- }
-
- void PreorderTraversal( BinTree BT )
- {
- if( BT ) {
- printf("%d ", BT->Data );
- PreorderTraversal( BT->Left );
- PreorderTraversal( BT->Right );
- }
- }
-
- void PostorderTraversal( BinTree BT )
- {
- if( BT ) {
- PostorderTraversal( BT->Left );
- PostorderTraversal( BT->Right );
- printf("%d ", BT->Data);
- }
- }
-
- void LevelorderTraversal ( BinTree BT )
- {
- Queue Q;
- BinTree T;
-
- if ( !BT ) return;
-
- Q = CreatQueue();
- AddQ( Q, BT );
- while ( !IsEmpty(Q) ) {
- T = DeleteQ( Q );
- printf("%d ", T->Data);
- if ( T->Left ) AddQ( Q, T->Left );
- if ( T->Right ) AddQ( Q, T->Right );
- }
- }
posted on
2019-08-08 20:18
董南
阅读(
346)
评论()
编辑
收藏
举报