Sicily 1156 Binary tree(搜尋)

//簡單的搜尋題<br />#include<iostream><br />#include<vector><br />using namespace std;<br />struct Node<br />{<br />char id;<br />int left;<br />int right;<br />bool root;<br />}node[1001];<br />void print(int i)//遞迴列印先序遍曆<br />{<br />if(i == 0)return;<br />cout << node[i].id;<br />print(node[i].left);<br />print(node[i].right);<br />}<br />int main()<br />{<br />int n,index,root_num;<br />//freopen("in.txt","r",stdin);<br />//freopen("out.txt","w",stdout);<br />while(cin >> n)<br />{<br />vector<int> v;<br />while(n--)<br />{<br />cin >> index;<br />v.push_back(index);<br />cin >> node[index].id >> node[index].left >> node[index].right;<br />node[index].root = 1;<br />}<br />for(int i = 0;i < v.size();i++)<br />{<br />int l = node[v[i]].left,r = node[v[i]].right;<br />node[l].root = 0;<br />node[r].root = 0;<br />}//將有被指向的結點將root置零，表示不是根節點。則最後沒有被置零的為根節點<br />for(int i = 0;i < v.size();i++)<br />{<br />if(node[v[i]].root == 1)<br />root_num = v[i];<br />}//找出根節點<br />print(root_num);//列印<br />cout << endl;<br />}<br />return 0;<br />}