計算機概論筆記-Traversal of Binary Tree

Submitted by dream_fly on 五, 2008-05-30 16:04

Depth-first traversal of Binary Tree

 

1.Preorder Traversal:Center , Left , Right.

 

2.Inorder Traversal:Left , Center , Right.

 

3.Postorder Traversal: Left , Right , Center.

 

Breadth-first traversal of Binary Tree

 

1.必須完成同一個等級的所有”nodes”才能前往下一個等級.