Given below is a rooted binary tree:
What is the sequence of nodes formed by the level-order traversal of the tree? Apply the traversal and print the sequence in the field below of nodes separated by spaces. For example, your output may look like this: 2 3 1 5 4 6