＜数据结构＞二叉树链式存储结构的建立

#include<iostream>
using namespace std;
template<class T>
struct BTNode
{
	T data;//数据域
	BTNode* left, *right;
	BTNode(const T& item = T(), BTNode* lptr = NULL, BTNode* rptr = NULL) :data(item), left(lptr), right(rptr) {}

};
template<class T>
BTNode<T>* GetBTNode(const T& item, BTNode<T>* lp = NULL, BTNode<T>* rp = NULL)
{
	BTNode<T>* p = new BTNode<T>(item, lp, rp);
	if(p==NULL)
		{
			cout<<"空间不足错误警告"<<endl;
		}
		return(p);
}
int main()
{
	BTNode<char>*f=GetBTNode('F');
	BTNode<char>* e = GetBTNode('E');
	BTNode<char>* d = GetBTNode('D');
	BTNode<char>* c = GetBTNode('C',f);
	BTNode<char>* b = GetBTNode('B',d,e);
	BTNode<char>* a = GetBTNode('A',b,c);

}