Question

TA binary tree that has a cycle can be traversed in pre-order, post-order, or in-order.

a) True if the cycle includes the root
b) Cannot be determined from the premise
c) False
d) True

choose one and please explain why.

Answer 1

Dear Student,

below is the answer..

==================================================================

Option d)True

Explanation:

Even if the cycle does not include root, we can traverse all the nodes because we maintain nodes that are already visited. Hence Inorder, pre and post order can be done.

=================================================================

Kindly Check and Verify Thanks...!!!