80-100

When building a heap using build_heap(list), which of the following is true?

• The list is processed from the last parent backward

• The resulting tree is a max-heap

• The resulting tree is a min-heap

• The resulting structure is not a complete binary tree

Which of the following keys would appear in the left subtree after inserting [68, 88, 61, 89, 94, 50, 4, 76, 66, 82] into a BST?

• 61

• 50

• 76

• 94

Which properties apply to a binary search tree created from randomly generated integers?

• The tree will always be complete

• The shape of the tree depends on insertion order

• Values in the left subtree are always less than root

• It is always balanced

What structure results from inserting [1, 2, 3, ..., 10] into a binary heap (min-heap) one at a time?

• The heap has the smallest number at the root

• The structure is a max-heap

• The tree is not complete

• Each parent is less than or equal to its children

What structure results from inserting [10, 9, 8, ..., 1] into a binary heap (min-heap) one at a time?

• The last number becomes the root

• The tree is skewed

• The structure remains a complete binary tree

• Each parent is greater than its children

Why must we check for None before calling a method like preorder() on a tree node, but not when using a function-based traversal?

• Methods require a real object to invoke

• Functions can handle None as an argument

• Methods create their own stack

• Preorder functions are always recursive

Which of the following keywords are used in Python?

• else

• elif

• if

• endif

Which of the following are valid Python loops?

• repeat

• loop

• while

• for

Which of these are valid ways to print in Python?

• echo 'Hello'

• print('Hello')

• print("Hello")

• printf('Hello')

Which of the following are valid variable names in Python?

• 2var

• my_var

• class

• _hidden