Exploring Tree-Inorder Traversal

In last post Introduction to tree data structures, I have give a brief introduction about tree data structure and its applications. Traversing a tree data structure is interesting as well as complicated as compare to linear data structures. Unlike arrays or linked list which are traversed in linear order, tree data structure can we traversed in multiple ways like depth first order (inorder, preorder, postorder) and breadth first order(level order traversal).
Read more-
https://paragnaik2019.medium.com/exploring-tree-inorder-traversal-70250862d5b1