Binary Search Tree Template

#ifndef __TREE__TEMPLATE__NODE__H__
#define __TREE__TEMPLATE__NODE__H__

#pragma once

template <class T>
class CNode
{
public:
	T		m_Node ;
	CNode	*m_pLeft ;
	CNode	*m_pRight ;
	CNode	*m_pParent ;
public:
	CNode(void) ;
	CNode(T &obj) ;
	~CNode(void) ;
};

template <class T>
CNode<T>::CNode(void)
{
	m_pLeft = NULL ;
	m_pRight = NULL ;
	m_pParent = NULL ;
}

template <class T>
CNode<T>::CNode(T &obj)
{
	m_Node = obj ;
	m_pLeft = NULL ;
	m_pRight = NULL ;
	m_pParent = NULL ;
}

template <class T>
CNode<T>::~CNode(void)
{
}
#endif