A binary tree traversal method that recursively traverses the left subtree,then visits the root,then traverses the right subtree is called
A) root-centric traversal
B) priority order traversal
C) postorder traversal
D) inorder traversal

Name: A binary tree traversal method that recursively traverses the left subtree,then visits the root,then traverses the right subtree is called A) root-centric traversal B) priority order traversal C) postorder traversal D) inorder traversal
Brand: Quizplus
Rating: 4.8 (31 reviews)

Question

Quizplus · Accepted Answer

The Answer is D

A Binary Tree Traversal Method That Recursively Traverses the Left