Gate CS-2004 Question Paper With Solutions

Q. 1 Level order traversal of a rooted tree can be done by stating from the root and

performing

(A) preorder traversal

(B) inorder traversal

(C) depth first search

(D) breadth first search

Answer: (D)

Explanation:

Learn More:   Gate EC-2018 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here