Discrete Structures 2 Midterms

A full binary tree with 10 leaf nodes has how many total nodes?

• 21

• 22

• 19

• 20

In a complete binary tree, where does the last inserted node always appear?

• rightmost position of the lowest level

• leftmost position of the lowest level

• at the root

• anywhere in the tree

What is the minimum height of a binary search tree with 15 nodes?

• 6

• 5

• 4

• 3

Which traversal method gives the sorted order of elements in a Binary Search Tree?

• In-order

• Pre-order

• Post-order

• Level-order

Which tree traversal method is best suited for evaluating algebraic expressions?

• In-order

• Pre-order

• Post-order

• Level-order

Which tree traversal method visits the root node first, then left subtree, then right subtree?

• In-order

• Pre-order

• Post-order

• Level-order

Which of the following is NOT a tree traversal method?

• In-order

• Pre-order

• Post-order

• Reverse

Which traversal technique is used for implementing an expression tree evaluation?

• In-order

• Pre-order

• Post-order

• Level-order

How many different binary trees can be formed with 3 nodes?

• 11

• 7

• 9

• 5

How many different binary trees can be formed with 4 nodes?

• 24

• 42

• 16

• 14