Question

Root is processed first in traversal​

Answer 1

COMPLETE QUESTION :

"In which order, the root is processed first in traversal?"

Answer:

Pre-order traversal

Explanation:

In pre-order traversal, the first root node is traversed, and then the left subtree, and at last the right subtree. The leftmost element is the root of the tree. In Pre-order traversal visits each node before visiting the node's children.

Tree data structure shows hierarchical relations. Traversal is a process of navigating around this tree. Thee are other traversal methods for binary search trees, namely, post-order traversal and in-order traversal.

#SPJ3