Discrete Structure20805 marksTree traversal methods
Describe pre-order, postorder and inorder traversal of a tree with an example.
Describe pre-order, postorder and inorder traversal of a tree with an example. [5]
Tree traversal means visiting every node of a tree exactly once in a systematic way. The three standard depth-first traversal methods differ in when the root (parent) node is visited relative to its subtrees. --- --- Algorithm: 1. Visit the root node 2. Recursively traverse the left subtree 3. Re...