1、#include#define MAX 30 /樹節(jié)點的最大數(shù)using namespace std;templateclass nodepublic:node()child = nextsibling = NULL;T ele; /節(jié)點值node*child, *nextsibling;/左兒子右兄弟;templateclass Mytreepublic:Mytree()tree = NULL;Mytree()delete tree;void CreatTree(node*); /構(gòu)造孩子兄弟表示法的樹T GetParent(node*,T t); /返回樹的父親節(jié)點T GetLeftChi

2、ld(node*,T); /返回樹的最左兒子T GetRightsibling(node*,T); /返回樹的最右兄弟T GetRoot(node*); /返回樹的根節(jié)點node* RetPoint(T, node*); /返回值為t的節(jié)點的指針node* RetParentPoint(T, node*);/返回值為t的節(jié)點父親指針void Display(node*); /樹的左兒子右兄弟表示法的前序、中序、后序遍歷private:void preTraverseTree(node*); /遞歸先序遍歷void InTraverseTree(node*); /遞歸中序遍歷void PostT

3、raverseTree(node*); /遞歸后序遍歷node *tree;templatevoid Mytree:CreatTree(node*tree) /構(gòu)造左兒子右兄弟表示的樹 /以tree為根節(jié)點構(gòu)建if (*tree) != NULL)cout 輸入節(jié)點 ele 的左兒子右兄弟(沒有的話輸入#)：;node*a = new node;node*b = new node;cin a-ele b-ele;if (a-ele != #) (*tree)-child = a; /有左兒子else (*tree)-child = NULL;if (b-ele != #) (*tree)-ne

4、xtsibling = b; /有有兄弟else (*tree)-nextsibling = NULL;CreatTree(&(*tree)-child); /遞歸構(gòu)造樹CreatTree(&(*tree)-nextsibling);templateT Mytree:GetParent(node *tree,T t) /返回節(jié)點值為t的父親node*p = RetParentPoint(t, tree);if (p)return p-ele;else return NULL;templateT Mytree:GetRoot(node*tree) /返回樹的根節(jié)點值return tree-ele

5、;templateT Mytree:GetLeftChild(node*tree,T t) /返回樹的左兒子node*p=RetPoint(t, tree);if (p&p-child) return p-child-ele;else return NULL;templateT Mytree:GetRightsibling(node*tree,T t) /得到樹tree的右兄弟node*p=RetPoint(t, tree);if (p&p-nextsibling) return p-nextsibling-ele;else return NULL;templatevoid Mytree:Di

6、splay(node*tree) /三種遞歸遍歷cout 先序遞歸遍歷：;preTraverseTree(tree);cout endl;cout 中序遞歸遍歷：;InTraverseTree(tree);cout endl;cout 后序遞歸遍歷：;PostTraverseTree(tree);cout endl;templatevoid Mytree:preTraverseTree(node*tree) /先序遞歸遍歷if (tree)cout ele child);preTraverseTree(tree-nextsibling);template void Mytree:InTrave

7、rseTree(node*tree) /中序遞歸遍歷if (tree)InTraverseTree(tree-child);cout ele nextsibling);templatevoid Mytree:PostTraverseTree(node*tree) /后序遞歸遍歷if(tree)PostTraverseTree(tree-nextsibling);PostTraverseTree(tree-child);cout ele ;templatenode* Mytree:RetPoint(T t, node* tree) /返回樹節(jié)點值為t的指針if (tree)if (tree-el

8、e = t) return tree;else if (RetPoint(t, tree-child)!=NULL)return RetPoint(t, tree-child);else if (RetPoint(t, tree-nextsibling) != NULL)return RetPoint(t, tree-nextsibling);else return NULL;else return NULL;templatenode* Mytree:RetParentPoint(T t, node*tree)if (tree&tree-child)if (tree-ele = t) retu

9、rn tree;else if (RetParentPoint(t, tree-child)return RetParentPoint(t, tree-child);else if (RetParentPoint(t, tree-nextsibling)return RetParentPoint(t, tree-nextsibling);else return NULL;int main()Mytree mytree;node *root = new node;cout root-ele;mytree.CreatTree(&root);cout樹的根：mytree.GetRoot(root)endl;cout t;cout t的左兒子 mytree.GetLeftChild(root, t) endl;cout t的右兄弟 mytree.GetRightsibling(root, t) endl;cout t的父節(jié)點： mytree.GetParent(root,t) endl;cout 樹的左兒子右兄弟表示法的三種遍歷： endl;mytree.Display(root);return 0;/*輸入根節(jié)點：a輸入節(jié)點a的左兒子右兄弟(沒有的話輸入#)：b c輸入節(jié)點b的左兒子右兄弟(沒有的話輸入#)：d e輸入節(jié)點d的左兒子右兄弟(沒有的話輸入#)：# #輸入節(jié)點e