A level-order traversal of a tree is also known as a breadth-first traversal.Group of answer choicesTrueFalse

Which traversal technique visits the tree level by level, from left to right?OptionsLevel-order traversalIn-order traversalPre-order traversalPost-order traversal

Which tree traversal visits the nodes in the following order: root, left subtree, right subtree?Group of answer choicesIn OrderPostOrderPreorderLevel Order

Visiting root node first then left and right sub-trees is called Answer choicesSelect only one optionREVISITIn-order TraversalPost-order TraversalPre-order TraversalNone of these

Depth First Search is equivalent to which of the traversal in the Binary Trees?Group of answer choicesIn-order TraversalPost-order TraversalPre-order TraversalLevel-order Traversal

Which of the following binary search tree traversal gives a sorted list of elements?Group of answer choicesInorderPostorderPreorderLevelorder