Trees

Which traversal will give the order A, B, C, D, E, F, G?

• Preorder

• None of the other options will give this

• Postorder

• Inorder

What is the maximum number of nodes in a binary tree of height 3?

• 16

• 15

• 8

• 7

How many leaf are there in the tree?

• 1

• 4

• 3

• 7

In this tree, where would the new value "7" be placed?

• On the left "leaf" of "4"

• On the right "leaf" of "6"

• On the left "leaf" of "15"

• Over the top of the current number "5"

Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

• Pre-Order

• Post-Order

• None

• In-Order

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

Consider the given AVL Tree. How many number of rotations are required after deleting 3?

• 1

• 2

• 3

• 4

Which of the following illustrations have all their correct balance factors correctly displayed (in red)?

• 
• 
• 
• 

Which one of the following is the full binary tree?

• 
• 
• 
• 

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

• Balanced Tree

• Right Tree

• Perfect Tree

• Unbalanced Tree