Traversing a Binary Tree in Preorder
January 18, 2020
A binary tree can be traversed in two basic ways – preorder and postorder. Explained below is the process or preorder traverse of a binary tree with an algorithm and the actual C routine.
![Preorder traversal of a Binary tree](https://www.getallarticles.com/wp-content/uploads/2020/01/4A51912A-CBCE-4043-867E-9DDA7E0A87AD-e1579377867386.jpeg)
![Preorder traversal of a Binary tree](https://www.getallarticles.com/wp-content/uploads/2020/01/86A7D0FD-8E5A-4832-9901-343F0028824C-e1579378185922.jpeg)
![Preorder traversal of a Binary tree](https://www.getallarticles.com/wp-content/uploads/2020/01/EFBEE63C-D7BA-4C76-9A54-5F06D6BB819D-e1579377955883.jpeg)