多叉树的层次遍历算法

1、多叉树的层次遍历算法疯狂代码 http:/CrazyC j:http:/CrazyC最近学习c越看越觉得以前所学只是皮毛这几天正好有空闲就写点小算法玩玩 多叉树层次遍历这个在网上有完整好像不多这次我就把写贴出来， 有兴趣朋友起来硏究下.TreeNode.h 文件# ndef_TREENODE_# _TREENODE_# -StdAfx.h'# v># <list># v iostream a# vqueueusing std;TreeNodeprivate:long selfID;nodeName;list<TreeNode*> *p_childList;

2、public:TreeNode;TreeNode;/*向当前节点中插入个子节点*/void insertChildNode(TreeNode *treeNode);广遍历树层次遍历*/void Level Traverse;判断某个节点是否为叶子节点bool isLeaf;返回当前节点孩子集合list <TreeNode*>* getChildList;long getSelfld;void Selfld(long selfID);getNodeName;void NodeName( &nodeName);；返回当前节点孩子集合inline list <TreeNod

3、e*>* TreeNode:getChildListp_childList;inline long TreeNode:getSelfIdselfID;inline void TreeNode:SelfId(long self ID)this->selfID = self ID;inline TreeNode:getNodeNamenodeName;inline void Tr0eNode:NodeName( &nodeName)this >nodeName = nodeName;#endTreeNode.cpp 文件# "stdafx.h"# &q

4、uot;TreeNode.h"TreeNode:TreeNode selfID = 0;no deName ="": p_childList = NULL;1TreeNode:TreeNodedelete p_childList; _判断某个节点是否为叶子节点bool TreeNode:isLeaf(NULL p_childList)true;false;/*向当前节点中插入个子节点*/void TreeNode:insertChildNode(TreeNode *treeNode)(NULLtreeNode)cout<<"treeNode

5、is null !'<<endl;(isLeaf)p_childList = list<TreeNode*>p_childList->push_back(TreeNode*)treeNode);/*遍历树层次遍历*/void TreeNode:LevelTraversequeue< TreeNode* > queue ;queue.push(TreeNode*)this);TreeNode *p = NULL;while (Iqueue.empty)p = queue.front;queue.pop;cout<< "tre

6、enode is:B< <p- >getSelfld< <endl;(NULL!= p->getChildList)list<TreeNode*>:iterator it = (p->getChildList)->begin;while(it!= (p->getChildList)->end)queue.push(*it);it;测试代码：# "stdafx.h"# "TreeNode.h"(argc, char* argv)TreeNode root;root.Selfld(O);

7、TreeNode *nodel = TreeNode;TreeNode *node2 = TreeNode;TreeNode *node3 = TreeNode; TreeNode *nodelO = TreeNode;nodel0->SelfId(10);nodel->SelfId(l);node2->SelfId(2);node3->SelfId(3);root.insertChildNode(nodel);root.insertChildNode(node2);root.insertChildNode(node3); root.insertChildNode(no

8、delO);TreeNode *node4 = TreeNode;TreeNode *node5 = TreeNode;node4->SelfId(4);node5->SelfId(5);nodel->insertChildNode(node4); nodel->insertChildNode(node5);TreeNode *node6 = TreeNode;TreeNode *node7 = TreeNode;TreeNode *node8 = TreeNode;node6->SelfId (6);node7->SelfId(7);node8->Selfld(8);node4->insertChildNode(node6); node4- > insertchild Node(node7); node4->insertChildNode(node8);遍历root Level Traverse;delete nodel;delete node2;delete node3;delete node4;delete node5;delete node6;delete node7;delete node8;0；1打印出来结果是：0123104567 8 （其中10是故意用来测试）这个只是简