醫(yī)院設(shè)施基礎(chǔ)管理系統(tǒng)C++類樹

1、C+類樹醫(yī)院設(shè)施管理樹旳應(yīng)用,記錄任意兩個(gè)結(jié)點(diǎn)之間旳結(jié)點(diǎn)個(gè)數(shù),支出給定結(jié)點(diǎn)旳子結(jié)點(diǎn),瀏覽整個(gè)醫(yī)院旳構(gòu)造,C+,類 ,樹,醫(yī)院設(shè)施管理,C+,類#include #include #include #include#include #include using namespace std;class hosnodepublic:string name;int num;hosnode(string n = NULL, int number = 0);string Name();int Num();friend ostream& operator(ostream& out, hosnode& nod

2、e);hosnode:hosnode(string n, int number)name = n;num = number;string hosnode:Name()return name;int hosnode:Num()return num;ostream& operator(ostream& out, hosnode& node)out | setiosflags(ios_base:left) setw(8) | resetiosflags(ios_base:left) setw(8) node.num |;return out;class treenode/tree

3、node* parent; /父結(jié)點(diǎn)public:hosnode value;treenode* pc; /最左邊子結(jié)點(diǎn)treenode* ls; /左兄弟節(jié)點(diǎn)treenode* rs; /右兄弟節(jié)點(diǎn)treenode(hosnode m_value);/*void setvalue(hosnode m_value);void setchild(treenode* pointer);void setsibling(treenode* pointer);void insertfirst(treenode* node);void insertnext(treenode* node);void pri

4、nt();*/void visit();treenode:treenode(hosnode m_value) :value(m_value)pc = NULL;ls = NULL;rs = NULL;void treenode:visit()cout value pc = tmp2;elsetmp1 = find(parent);if (tmp1)tmp2 = new treenode(*value);if (tmp1-pc = NULL)tmp1-pc = tmp2;elsetmp3 = tmp1-pc;while (tmp3-ls)tmp3 = tmp3-ls;tmp3-ls = tmp2

5、;treenode* tree:Parent(treenode* cur)if (!cur)return NULL;elsetreenode *pointer = root, *tmp;queue nqueue;if (pointer)nqueue.push(pointer);while (!nqueue.empty()pointer = nqueue.front();tmp = pointer-pc;if (tmp != NULL)if (tmp-value).Name() = (cur-value).Name()return pointer;elsetmp = tmp-ls;if (tmp

6、 != NULL)while (tmp-value).name != (cur-value).name)tmp = tmp-ls;if (!tmp)break;if (tmp != NULL)return pointer;nqueue.pop();if (pointer-pc != NULL)nqueue.push(pointer-pc);tmp = pointer-pc-ls;while (tmp)nqueue.push(tmp);tmp = tmp-ls;return NULL;treenode* tree:find(string cur)treenode *pointer = root,

7、 *tmp;queue nqueue;if (pointer)nqueue.push(pointer);while (!nqueue.empty()pointer = nqueue.front();if (pointer-value).Name() = cur)return pointer;nqueue.pop();if (pointer-pc != NULL)nqueue.push(pointer-pc);tmp = pointer-pc-ls;while (tmp)nqueue.push(tmp);tmp = tmp-ls;return NULL;void tree:with(treeno

8、de* root)treenode *pointer = root, *tmp;int n = 0;queue nqueue;cout -n;cout | 名稱 | 數(shù)量 |n;cout );cout | setiosflags(ios_base:left) setw(8) setw(2) | setw(8) n resetiosflags(ios_base:left) | endl;cout pc != NULL)nqueue.push(pointer-pc);tmp = pointer-pc-ls;while (tmp)nqueue.push(tm

9、p);tmp = tmp-ls;int tree:count(string gparent, string child)int n = 1;if (find(gparent) = NULL | find(child) = NULL)return 0;else if ( = child)return 1;elsetreenode* tmp2 = find(child);n = tmp2-value.num;while (Parent(tmp2)-value).Name() != gparent) / 查找父結(jié)點(diǎn)n *= (Parent(tmp2)-value).Nu

10、m();tmp2 = Parent(tmp2);return n;void tree:interface1()cout %n;cout % 1、構(gòu)建醫(yī)院 %n;cout % 2、涉及記錄操作 %n;cout % 3、結(jié)點(diǎn)及孩子結(jié)點(diǎn)輸出 %n;cout % 4、瀏覽醫(yī)院構(gòu)造 %n;cout % 5、終結(jié)操作 %n;cout %n;cout 請選擇。;void tree:show(string n)treenode *tmp = find(n),*tmp2;while (tmp = NULL)int a;string name;cout 該醫(yī)院不涉及該部門（設(shè)施）！ endl;cout %n;co

11、ut % 1、繼續(xù)查找 %n;cout % 2、返回上層 %n;cout %n;cout a;switch (a)case 1:cout name;tmp = find(name);break;case 2:system(cls);s_treatment();break;system(cls);if (tmp-pc = NULL)cout 該名稱單位不涉及任何下屬設(shè)施! endl;elsecout 所涉及旳下屬設(shè)施: endl;cout -n;cout | 名稱 | 數(shù)量|n;cout -n;cout pc)-value endl;cout pc-ls;while (tmp2)cout val

12、ue endl;cout ls;void tree:s_treatment()string tmp1, tmp2;int n;ifstream inf(data.txt);interface1();cin n;system(cls);while (n != 5)switch (n)case 1:if (!inf)cout 讀取失??！ tmp1 tmp2 n;hosnode * value = new hosnode(tmp2, n);insert(tmp1, value);cout 讀取成功！ endl;break;case 2:cout tmp1 tmp2;cout tmp1 涉及 tmp2 : count(tmp1, tmp2);cout endl;break;case 3:cout tmp