[理工] [資結] 前序後序問題

[kuso0516 (隱)]

考慮以下程式碼

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
推 gskman:這....return後面是..?
推 w29697146:我記得會什麼都不回傳 直接結束function
→ feabries:         ●
→ feabries:        /  \
→ feabries:      ●    ●
→ feabries:     /  \  /  \
→ feabries:    ●  ●●  ●
→ feabries:   /      \
→ feabries:  ●      ●
→ feabries:          /
→ feabries:        ●
→ feabries:請問是這樣嗎?
推 gskman:應該 是吧XD
→ kuso0516:是的
推 AIdrifter:好玩 幫推一下=w=
推 i78524:好有趣的題目...
→ sneak:          / https://daxiv.com