treenode.hpp

来自「该源码实现二叉树的模拟」· HPP 代码 · 共 72 行

//////////////////////////////////////////////////////////////////////////
// TreeNode.hpp
// Author : sc
// Date : 2008/10/21

#ifndef _TREENODE_H_
#define _TREENODE_H_


#include "DataType.hpp"

template <class T>
class CTreeNode
{
	public:
		CTreeNode();
		CTreeNode(T& srcData, CTreeNode<T>* srcLPtr = NULL, CTreeNode<T>* srcRPtr = NULL);
		~CTreeNode();

		CTreeNode<T>*& Left(void);
		CTreeNode<T>*& Right(void);

		T		m_Data;
		int		m_nSubLabel;
		int		m_nLayerLabel;
		COOR	m_Coor;

	private:
		CTreeNode<T>* m_LSunTree;
		CTreeNode<T>* m_RSunTree;	

};

template <class T>
CTreeNode<T>::CTreeNode()
{
	m_LSunTree = NULL;
	m_RSunTree = NULL;
}


template <class T>
CTreeNode<T>::CTreeNode(T& srcData, CTreeNode<T>* srcLPtr /* = NULL */, CTreeNode<T>* srcRPtr /* = NULL */)
{
	m_Data = srcData;

	m_LSunTree = srcLPtr;
	m_RSunTree = srcRPtr;
}

template <class T>
CTreeNode<T>::~CTreeNode()
{

}

template <class T>
CTreeNode<T>*& CTreeNode<T>::Left()
{
	return m_LSunTree;
}

template <class T>
CTreeNode<T>*& CTreeNode<T>::Right()
{
	return m_RSunTree;
}




#endif // _TREENODE_H_