A binary tree traversal method that visits the root first,and then recursively traverses the left and right subtrees is called
A) top down traversal
B) priority order traversal
C) preorder traversal
D) postorder traversal

Name: A binary tree traversal method that visits the root first,and then recursively traverses the left and right subtrees is called A) top down traversal B) priority order traversal C) preorder traversal D) postorder traversal
Brand: Quizplus
Rating: 4.7 (36 reviews)

Question

Quizplus · Accepted Answer

The Answer is C

A Binary Tree Traversal Method That Visits the Root First,and