Page $8$ of $29$

EENG$212-$Lecture$1...$

$1000$

Search

Traversing Binary Trees

BINARY TREES

preorder traversal $($ depth$-$first order$)$

print root : left subtree : right subtree

inorder traversal $($symmetric order$)$

left subtree : print root ; right subtree

postorder traversal $($breadth$-$first order$)$

left subtree : right subtree : print root

Preorder: $$

EENG$212$: ALGORITHMS AND DATA STRUCTURES