The process of visiting all the nodes of a tree is known as tree traversal.
Some of the algorithms to traverse a binary tree are as follows :
* Pre-order Traversal.
* In order Traversal.
* Post order Traversal.
* Breadth First Search
* ZigZag Traversal.