1、 层序遍历二叉树
// 二叉树相关.cpp : 定义控制台应用程序的入口点。
//程序猴,2013.6.20
#include "stdafx.h"
#include <deque>
#include <malloc.h>
using namespace std;
//定义一个二叉树结点结构体
typedef struct Node
{
int Element;
struct Node* Left;
struct Node* Right;
}BiTreeNode,*BiTree;
//随机二叉树的插入元素,这里不设置T为引用类型的话,在第一个结点插入时,指针T的实参为NULL,对T的重新赋值不改变实参
void InsertElement(BiTree& T,int Data)
{
int R_L = rand()%2;
if(!T)
{
BiTreeNode* NewNode = (BiTreeNode*)malloc(sizeof(BiTreeNode));
if(!NewNode) return;
NewNode->Left = NULL;
NewNode->Right = NULL;
NewNode->Element = Data;
T = NewNode;
}
else if(!T->Left&&!T->Right)
{
BiTreeNode* NewNode = (BiTreeNode*)malloc(sizeof(BiTreeNode));
if(!NewNode) return;
NewNode->Left = NULL;
NewNode->Right = NULL;
NewNode->Element = Data;
if(R_L == 0)
T->Left = NewNode;
else
T->Right = NewNode;
}
else
{
if(R_L == 0)
InsertElement(T->Left,Data);
else
InsertElement(T->Right,Data);
}
}
//层序遍历二叉树
void TraversalByLevel(BiTree T)
{
if (!T)
return;
deque<BiTree> DequeTreeNode;
DequeTreeNode.push_back(T);
//实际是将结点逐层放在队列中,然后输出每一层的值,输出完后将结点从队列弹出
while(DequeTreeNode.size())
{
BiTreeNode* TNode = DequeTreeNode.front();
DequeTreeNode.pop_front();
printf("%d ",TNode->Element);
if(TNode->Left)
DequeTreeNode.push_back(TNode->Left);
if (TNode->Right)
DequeTreeNode.push_back(TNode->Right);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
BiTree T = NULL;
InsertElement(T,2);
InsertElement(T,3);
InsertElement(T,7);
InsertElement(T,5);
InsertElement(T,6);
InsertElement(T,10);
InsertElement(T,53);
InsertElement(T,53);
TraversalByLevel(T);
return 0;
}
运行结果:
2、把二叉搜索树转变为排序的双向链表(不创建新结点,指对指针操作)
//程序猴,2013.6.20
#include "stdafx.h"
#include <deque>
#include <malloc.h>
using namespace std;
//定义一个二叉树结点结构体
typedef struct Node
{
int Element;
struct Node* Left;
struct Node* Right;
}BiTreeNode,*BiTree;
//二叉查找树的插入元素
void InsertElement(BiTree& T,int Data)
{
if(!T)
{
BiTreeNode* NewNode = (BiTreeNode*)malloc(sizeof(BiTreeNode));
if(!NewNode) return;
NewNode->Left = NULL;
NewNode->Right = NULL;
NewNode->Element = Data;
T = NewNode;
}
else if (Data<T->Element)
InsertElement(T->Left,Data);
else if (Data>T->Element)
InsertElement(T->Right,Data);
}
//层序遍历二叉树
void TraversalByLevel(BiTree T)
{
if (!T)
return;
deque<BiTree> DequeTreeNode;
DequeTreeNode.push_back(T);
//实际是将结点逐层放在队列中,然后输出每一层的值,输出完后将结点从队列弹出
while(DequeTreeNode.size())
{
BiTreeNode* TNode = DequeTreeNode.front();
DequeTreeNode.pop_front();
printf("%d ",TNode->Element);
if(TNode->Left)
DequeTreeNode.push_back(TNode->Left);
if (TNode->Right)
DequeTreeNode.push_back(TNode->Right);
}
}
// 由于二叉搜索树的中序遍历结果即为排序好的,因此可以把中序遍历的结果存储起来作为输出
void ConvertToSortedLink(BiTree T,BiTree& SortedLink) //要求不改变T
{
if (!T)
return;
BiTreeNode* TheNode = T;
if (TheNode->Left)
ConvertToSortedLink(TheNode->Left,SortedLink);
TheNode->Left = SortedLink;//左指针指向上一个小值
if (SortedLink)
{
SortedLink->Right = TheNode;//有指针指向下一个大值;
}
SortedLink = TheNode;
if (TheNode->Right)
ConvertToSortedLink(TheNode->Right,SortedLink);
}
int _tmain(int argc, _TCHAR* argv[])
{
BiTree T = NULL;
InsertElement(T,2);
InsertElement(T,3);
InsertElement(T,7);
InsertElement(T,5);
InsertElement(T,6);
InsertElement(T,10);
InsertElement(T,53);
printf("层序遍历二叉树结果:");
TraversalByLevel(T);
BiTree SortedLinkList = NULL;
ConvertToSortedLink(T,SortedLinkList);
BiTreeNode* TheFirstNode = SortedLinkList;
while(TheFirstNode&&TheFirstNode->Left)
TheFirstNode = TheFirstNode->Left;
printf("\n遍历双向链表的结果:");
BiTreeNode* TraversalNode = TheFirstNode;
while(TraversalNode)
{
printf("%d ",TraversalNode->Element);
TraversalNode = TraversalNode->Right;
}
return 0;
}
运行结果: