Tree Traversal
1. Let us consider V to be the total number of vertices and E to be the total number of edges in a tree. What is the time complexity of Depth First Traversal in this tree?
2. While performing inorder traversal in a tree, what is the sequence of nodes that gets visited?
3. While performing preorder traversal in a tree, what is the sequence of nodes that gets followed?
4. For the post order traversal in the binary tree, what is the sequence of nodes that gets accessed?