It is C++. Data structure.

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

True

False

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

True

False

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

True

False

4. 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

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

		rotated right
		rotated left
		balanced
		unbalanced

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

True

False

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

True

False

Thank you so much!