Which of the following graph traversals closely imitates level order traversal of a binary tree? Q & A › Category: Data Structure › Which of the following graph traversals closely imitates level order traversal of a binary tree? 0 Vote Up Vote Down Admin Staff asked 4 years ago Which of the following graph traversals closely imitates level order traversal of a binary tree? a) Depth First Search b) Breadth First Search c) Depth & Breadth First Search d) Binary Search Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago b) Breadth First Search Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...