For the following binary tree, inorder traversal yields the expression:
KVS PGT Computer Science · 2017 · PGT Computer Science · Computer Science subject component
For the following binary tree, inorder traversal yields the expression:
- A.
− + * abde f
- B.
a + b d *− ef/
- C.
abdef* / + −
- D.
a + b * d − e / f
Attempted by 1261 students.
Sign up free to check your answer
Sign up freeLoading lesson…