UGC NET CS 2014 Dec-Paper-2
October 12, 2023Algorithms
October 12, 2023Algorithms
| Question 2 |
Which one of the following binary trees has its inorder and preorder traversals as BCAD and ABCD, respectively?
 | |
 | |
 | |
 |
Question 2 Explanation:
Inorder traversal is,
Left root right.
Preorder traversal is,
Root left right.
Left root right.
Preorder traversal is,
Root left right.
Correct Answer: D
Question 2 Explanation:
Inorder traversal is,
Left root right.
Preorder traversal is,
Root left right.
Left root right.
Preorder traversal is,
Root left right.
Subscribe
Login
0 Comments