Question

In level order traversal of a tree ,all nodes at same level are visited ; order of traversal being left to right. This traversal on a rooted tree can be achieved by initiating which operation on root?
1) breadth first search
2) depth first search
3) in- order traversal
4) preorder traversal

Answer 1

option 2 is your answer

hope this helps you

please mark it as brainliest please please plzzzzzz.....☺️