treenode.h

使用类模板生成与遍历二叉树：建立了一个二叉树

#ifndef TREENODE_H
#define TREENODE_H

template< class NODETYPE >  class Tree;		// forward declaration

template< class NODETYPE > 
class TreeNode
{
	friend class Tree< NODETYPE >;
public:
	TreeNode( const NODETYPE &d )
		: leftPtr( 0 ), data( d ), rightPtr( 0 ) { }
	NODETYPE getData() const { return data; }
private:
	TreeNode< NODETYPE > *leftPtr;		// pointer to left subtree
	NODETYPE data;		
	TreeNode< NODETYPE > *rightPtr;		// pointer to right subtree
};

#endif