2. Traversal of Binary Trees postorder At a given node there are three Ho in some order: Visit the node itself ere ts left subtree (L); traverse its rib sukeVA. Ty Are are six ways to arrange these tasks VLR LVR RV VRL RVL RLV By standard convention, these are reduced to three by considering only the ways in which the left subtree is traversed before the right These three names are chosen according to the step at which the given node is visited.2. Traversal of Binary Trees At a given node there are three tasks to do in some order: Visit the node itself (V); traverse its left subtree (L); traverse its right subtree (R). There are six ways to arrange these tasks: VLR LVR LRV VRL RVL RLV By standard convention, these are reduced to three by considering only the ways in which the left subtree is traversed before the right. postorder preorder inorder These three names are chosen according to the step at which the given node is visited