树转化为二叉树代码,C代码库,德仔网

代码语言

代码分类

【C】树转化为二叉树

作者:翔云酒天 / 发布于2013/8/5/ 870

树用儿子兄弟法


	#include<stack>
	#include<vector>

	template <class T>
	struct BinTreeNode
	{
	T element;
	BinTreeNode *LChild;
	BinTreeNode *RChild;

	BinTreeNode():element(),LChild(NULL),RChild(NULL){}
	~BinTreeNode(){}
	BinTreeNode<T> & operator = (const BinTreeNode<T> & t)
	{
	 element = t.element;
	 LChild = t.LChild;
	 RChild = t.RChild;
	 return *this;
	}
	};

	template <class T>
	class CBinTree
	{
	private:
	BinTreeNode<T> rootNode;
	public:
	BinTreeNode<T> *pTreeNode;
	BinTreeNode<T> * const pRootNode;
	CBinTree():rootNode(),pTreeNode(&rootNode),pRootNode(&rootNode){}

	std::vector<T> deepTraversal()
	{
	 pTreeNode = pRootNode;
	 std::stack<BinTreeNode<T> *> pstack;
	 std::vector<T> vNode;
	 while((*pTreeNode).LChild || (*pTreeNode).RChild || !pstack.empty())
	 {
	 if((*pTreeNode).LChild && (*pTreeNode).RChild)
	 {
	 vNode.push_back((*pTreeNode).element);
	 pstack.push(pTreeNode);
	 pTreeNode = (*pTreeNode).LChild;
	 }else if((*pTreeNode).LChild )
	 {
	 vNode.push_back((*pTreeNode).element);
	 pTreeNode = (*pTreeNode).LChild;
	 }else if((*pTreeNode).RChild)
	 {
	 vNode.push_back((*pTreeNode).element);
	 pTreeNode = (*pTreeNode).RChild;

	 }else{
	 vNode.push_back((*pTreeNode).element);
	 pTreeNode = (*pstack.top()).RChild;
	 pstack.pop();
	 }
	 }
	 vNode.push_back((*pTreeNode).element);
	 return vNode;
	}
	void createBTree(BinTreeNode<T> t)
	{
	 rootNode = t;
	}
	BinTreeNode<T> getRootNode()
	{
	 return rootNode;
	}
	CBinTree<T> & operator = (const CBinTree<T> & t)
	{
	 rootNode = t.rootNode;
	 return *this;
	}
	void init()
	{
	 pTreeNode = pRootNode;
	}
	};

试试其它关键字

　二叉树　

同语言下

可能有用的

翔云酒天贡献的其它代码(2)