Binary Search Trees

In a ____, for any node 'n' every descendant node's value in the left subtree is less than n and in the right subtree is greater than n.

• Binary Tree

• Binary Search Tree

• AVL Tree

• Binary Heap Tree

The ____ of a Binary Search Tree starts by visiting the current node, then its left child node and then its right child node.

• Pre-Order Traversal

• In-Order Traversal

• Post-Order Traversal

• Linear Order Traversal

A ____ is a Binary Search Tree whose left and right subtree differ in height by at most 1 unit; and whose left and right subtrees are AVL trees.

• Red-Black Tree

• AVL Tree

• Binary Heap Tree

• Complete Binary Tree

For an AVL Tree, the ____ is the additional piece of information which indicates if the difference in height between the left and the right subtree is the same or not; which of the two subtrees has one unit larger height.

• Tree Factor

• Balance Factor

• Additional Factor

• Unit Factor

A Binary Tree can have

• 2 children

• 1 child

• 0 child

• all of the above

Binary Search works best on

• Equally effective on sorted and unsorted lists

• Unsorted lists

• Sorted lists

• None of the above

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

Given a sequence of number below:

50,60,40,70,45,55,30,80,65,35,25,75,85

When creating a binary search tree, what is the height of the tree?

• 3

• 4

• 5

• 6

A Balanced Tree has equal number of items on each subtree.

• True
• False

Root has more left descendants than the right descendants or vice versa.

• Balanced Tree
• Perfect Tree
• Right Tree
• Unbalanced Tree