学步园

#include "stdafx.h"<br /> #include <iostream><br /> #include <string><br /> using namespace std;<br /> //树的节点<br /> struct TreeNode<br /> {<br /> char element;<br /> int childNumbers;//孩子结点的个数<br /> struct TreeNode* child[3];//孩子的数组<br /> TreeNode(){}<br /> TreeNode(char ele, int numbers)<br /> {<br /> element = ele;<br /> childNumbers = numbers;<br /> for (int i=0; i<3; i++)<br /> child[i] = NULL;<br /> }<br /> //重载赋值运算符<br /> TreeNode& operator = (const TreeNode& other)<br /> {<br /> if(this == &other)<br /> return *this;<br /> else<br /> {<br /> element = other.element;<br /> childNumbers = other.childNumbers;<br /> for (int i=0; i<3; i++)<br /> child[i] = other.child[i];<br /> }<br /> }<br /> };<br /> //二叉树的结点<br /> typedef struct BTreeNode<br /> {<br /> char element;<br /> BTreeNode *left;<br /> BTreeNode *right;<br /> BTreeNode(char ele = 0, BTreeNode *lchild = NULL, BTreeNode *rchild=NULL)<br /> {<br /> element = ele;<br /> left = lchild;<br /> right = rchild;<br /> }<br /> }BTreeNode;<br /> //构建树<br /> void CreateTree(TreeNode* &root)<br /> {<br /> TreeNode *e = new TreeNode('E', 0);<br /> TreeNode *f = new TreeNode('F', 0);<br /> TreeNode *b = new TreeNode('B', 2);<br /> b->child[0] = e;<br /> b->child[1] = f;<br /> TreeNode *g = new TreeNode('G', 0);<br /> TreeNode *d = new TreeNode('D', 1);<br /> d->child[0]= g;<br /> TreeNode *c = new TreeNode('C', 0);<br /> root = new TreeNode('A', 3);<br /> root->child[0] = b;<br /> root->child[1] = c;<br /> root->child[2] = d;<br /> }<br /> //将树转换为二叉树<br /> BTreeNode* TreeToBinaryTree(TreeNode *treeRoot)<br /> {<br /> if (treeRoot == NULL)<br /> {<br /> return NULL;<br /> }<br /> BTreeNode* binaryRoot = new BTreeNode; //二叉树的根<br /> binaryRoot->element = treeRoot->element;<br /> binaryRoot->left = TreeToBinaryTree(treeRoot->child[0]); //左孩子<br /> BTreeNode *brotherChild = binaryRoot->left; //兄弟<br /> for (int i= 1; i<treeRoot->childNumbers; i++)<br /> {<br /> brotherChild->right = TreeToBinaryTree(treeRoot->child[i]);<br /> brotherChild = brotherChild->right;<br /> }<br /> return binaryRoot;<br /> }<br /> //二叉树中序输出<br /> void MiddleOrderPrint(BTreeNode *root)<br /> {<br /> BTreeNode *temp = root;<br /> if(temp == NULL)<br /> return;<br /> else<br /> {<br /> MiddleOrderPrint(temp->left);<br /> cout<<root->element<<" ";<br /> MiddleOrderPrint(temp->right);<br /> }<br /> }<br /> int main()<br /> {<br /> TreeNode *treeRoot;<br /> CreateTree(treeRoot);<br /> BTreeNode *binaryRoot = TreeToBinaryTree(treeRoot);<br /> MiddleOrderPrint(binaryRoot);<br /> cout<<endl;<br /> return 0;<br /> }<br />  

http://blog.csdn.net/wade23/archive/2009/10/09/4646789.aspx