#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
#include <stdlib.h>
#include<string.h>
enum ThdInfo
{
LINK,
THREAD
};
template<class T>
struct BinaryTreeThdNode
{
BinaryTreeThdNode(const T& data)
: pleft(NULL)
, pright(NULL)
, pParent(NULL)
, _data(data)
, leftThd(LINK)
, rightThd(LINK)
{}
BinaryTreeThdNode<T>* pleft; //左孩子
BinaryTreeThdNode<T>* pright; //右孩子
BinaryTreeThdNode<T>* pParent; //双亲结点
T _data;
ThdInfo leftThd; //左线索
ThdInfo rightThd; //右线索
};
template<class T>
class BinaryTreeThd
{
public:
BinaryTreeThd()
:_pRoot(NULL)
{}
BinaryTreeThd(T array[], size_t size)
{
size_t index = 0;
_CreateBinaryTree(_pRoot, array, size, index);
}
void PreOrderThd()
{
BinaryTreeThdNode<T>* prev = NULL;
_PreOrderThd(_pRoot,prev);
}
void PreOrder()
{
_PreOrder(_pRoot);
}
void InOrderThd()
{
BinaryTreeThdNode<T>* prev = NULL;
_InOrderThd(_pRoot,prev);
}
void InOr
二叉树的线索化以及遍历(前序、中序、后序)
最新推荐文章于 2023-03-15 23:13:15 发布