Please answer all questions:

QUESTION 1

1. The load factor is a value associated with a tree node that is the difference in height between its two subtrees.

   True

   False

QUESTION 2

1. A node whose balance factor is 12 is what kind of node?

   		balanced
   		unbalanced
   		rotated left
   		rotated right

QUESTION 3

1. Rotations on AVL trees can be single or double.

   True

   False

QUESTION 4

1. An AVL tree offers no practical benefit to a binary search tree, it's merely an alternative implementation.

   True

   False

QUESTION 5

1. AVL trees have the same sorting property requirement as binary search trees.

   True

   False

QUESTION 6

1. A binary tree can be represented in a non-linked way, using an array.

   True

   False

QUESTION 7

1. A binary tree may only be traversed using iteration.

   True

   False

QUESTION 8

1. In terms of complexity ( Big-O ), it takes longer to destroy a binary search tree than it does a linked ( non-array ) linked list.

   True

   False

QUESTION 9

1. The time complexity for locating a value within a binary search tree is

   		O( log2N )
   		O( N )
   		O( N2 )
   		O( N3 )

QUESTION 10

1. The type of traversal of a binary tree in which all the nodes of the left subtree of a node are processed, then the node itself is processed, then all the nodes of the right subtree is

   		inorder traversal
   		preorder traversal
   		postorder traversal
   		hyperorder traversal