In-Class

First Name *

Last Name *

How many pointers does a binary tree node have? *

2 points

0 - None

1 - Usually called 'next'

2 - Usually called 'left' and 'right'

What is the advantage of a binary search tree? *

1 point

There are no inherent advantages to the binary tree.

Because we know the ordering of the elements in the binary tree (and if the binary tree is balanced), we can often traverse the tree faster and find all of the elements.