Prashant TripathiLevel-Order Traversal (BFS)A level-order traversal of tree is a recursive algorithm that processes the root, followed by the children of the root (from left to…Jan 19, 2020Jan 19, 2020
Prashant TripathiPreOrder Traversal (DFS)A preorder traversal of tree is a recursive algorithm that processes the root and then performs preorder traversals of the left and right…Dec 8, 2019Dec 8, 2019
Prashant TripathiPostOrder TraversalA postorder traversal of tree is a recursive algorithm that follows the left and right subtrees before processing the root element. The…Dec 8, 2019Dec 8, 2019
Prashant TripathiInOrder TraversalAn inorder traversal of tree is a recursive algorithm that follows the left subtree; once there are no more left subtrees to process, we…Dec 8, 2019Dec 8, 2019