Site Links
Question #1
When a binary tree is searched, each comparison of data ordered in a binary tree eliminates half of the remaining nodes
Question #2
Each level of a binary tree has 8 more nodes than the level above it
Question #3
There are three types of traversals: in-order, reverse-order and postorder traversals.
Question #4
A preorder traversal visits the left node first, then the right node, and then the root
Question #5
Hashing is used to arrange records in a data file