[理工] [資結] 前序後序問題
考慮以下程式碼
void order(node p){
if(p == NULL) return;
order(p->left);
cout<<")";
order(p->right);
cout<<"(";
}
若某二元樹T的order(T)結果為
)()()))()((())())(((
求該二元樹
節點可任意命名
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.231.44.144
推
11/26 01:11, , 1F
11/26 01:11, 1F
推
11/26 01:20, , 2F
11/26 01:20, 2F
→
11/26 02:43, , 3F
11/26 02:43, 3F
→
11/26 02:43, , 4F
11/26 02:43, 4F
→
11/26 02:43, , 5F
11/26 02:43, 5F
→
11/26 02:43, , 6F
11/26 02:43, 6F
→
11/26 02:43, , 7F
11/26 02:43, 7F
→
11/26 02:43, , 8F
11/26 02:43, 8F
→
11/26 02:43, , 9F
11/26 02:43, 9F
→
11/26 02:43, , 10F
11/26 02:43, 10F
→
11/26 02:43, , 11F
11/26 02:43, 11F
→
11/26 02:43, , 12F
11/26 02:43, 12F
推
11/26 03:13, , 13F
11/26 03:13, 13F
→
11/26 06:48, , 14F
11/26 06:48, 14F
推
11/26 19:33, , 15F
11/26 19:33, 15F
推
11/27 18:58, , 16F
11/27 18:58, 16F
→
09/11 14:37, , 17F
09/11 14:37, 17F
討論串 (同標題文章)