Test: Computer Science

1.

What is the difference between inorder traversal of a binary search tree and a preorder traversal?

In order traversal processes the left subtree, then the root node, then the right subtree, whereas preorder processes the root node, left subtree, then right subtree.

The only difference is that in order processes the root node, whereas preorder does not.

In order traversal processes the right subtree, then the root node, then the left subtree, whereas preorder processes the left subtree, then the root node, the the right subtree.

They are similar.

Preorder searches through the tree from lowest to highest, inorder does not.

1/2 questions

0%
Learning Tools by Varsity Tutors