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

What is in-order traversal?left subtree is visited first, then the right subtree and finally the root nodethe root node is visited first, then the left subtree and finally the right subtreethe left subtree is visited first, then the root and later the right sub-tree

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

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

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