1、精選優質文檔-傾情為你奉上精選優質文檔-傾情為你奉上專心-專注-專業專心-專注-專業精選優質文檔-傾情為你奉上專心-專注-專業#include#include#include #include #include#includeusing namespace std;class hosnode/醫院節點 friend class Tree; hosnode* father;/父親指針； hosnode* left_child;/左孩子 hosnode* right_brother;/右兄弟 string name;/節點名稱 int n;/數量public: hosnode(string nn,

2、int b) name=nn; n=b; string getname() return name; int get_n() return n; ;class Tree/結構類（這里為醫院結構類） hosnode* head;public: Tree(string name,int n) head=new hosnode(name,n); head-left_child=0; head-right_brother=0; head-father=0; hosnode *find(string name) hosnode* temp=head; if(name=temp-name)return t

3、emp; queue a; a.push(temp); while(!a.empty() temp=a.front()-left_child;/出隊列 a.pop(); while(temp!=0) a.push(temp); if(name=temp-name)return temp; temp=temp-right_brother; return 0; bool insert(string father,string child,int n) hosnode* temp=find(father); if(temp-left_child=0) temp-left_child=new hosn

4、ode(child,n); temp-left_child-right_brother=0; temp-left_child-father=temp; temp-left_child-left_child=0; else temp=temp-left_child; while(temp-right_brother!=0) temp=temp-right_brother; temp-right_brother=new hosnode(child,n); temp-right_brother-right_brother=0; temp-right_brother-father=find(fathe

5、r); temp-right_brother-left_child=0; return 1; int get_number(string big,string small)/ hosnode* p1=find(big); hosnode* p2=find(small); int sum=1; while(p2!=0&p2!=p1) sum*=p2-n; p2=p2-father; if(p2=0) return 0; else return sum; hosnode * childs(string name) hosnode * temp=find(name); if(temp=0)retur

6、n 0; else coutnameleft_child; if(temp=0)cout無; while(temp!=0) coutnameright_brother; coutname); queue a; a.push(temp); while(!a.empty() temp=a.front()-left_child;/出隊列 a.pop(); while(temp!=0) a.push(temp); childs(temp-name); temp=temp-right_brother; ;int main() int flag = 1 ; string p,c;Tree a(醫院,1);

7、a.insert(醫院,樓層,10);a.insert(樓層,配樓,4);a.insert(樓層,中央大廳,1);a.insert(中央大廳,電視,1);a.insert(中央大廳,沙發,2);a.insert(配樓,長走廊,2);a.insert(配樓,走廊連接,1);a.insert(走廊連接,庫房,5);a.insert(長走廊,病房,21);a.insert(病房,衛生間,1);a.insert(病房,插座,4);a.insert(病房,病床,2);a.insert(衛生間,洗臉盆,1);a.insert(衛生間,座便器,1);a.insert(插座,插口,2);a.insert(插座,面板,1); while (flag) cout輸入要查找的父節點和子節點 p c; couta.get_number(p,c)endl; cout繼續輸入1,