COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following represents the Postorder Traversal of a Binary Tree?
|
|
Left
|
|
|
Left
|
|
|
Right
|
|
|
Right
|
Explanation:
Detailed explanation-1: -Postorder traversal of Binary tree is a traversal method, where left subtree is visited first, then right subtree, and finally root node. Unlike array and linked lists, being linear data structures, we have several ways of traversing binary trees due to their hierarchical nature.
Detailed explanation-2: -A binary tree can be traversed in three ways: Preorder = (Root, Left subtree, Right Subtree) Inorder = (Left subtree, Root, Right Subtree) Postorder = (Left Subtree, Right subtree, Root)
Detailed explanation-3: -The correct option is B gcdbfea The number of binary trees with 3 nodes which when traversed in post order gives the sequence A, B, C is?
There is 1 question to complete.