CMSC 132 Exam 2 With 100% Correct
And Verified Answers
Recursion - Correct Answer-A strategy for solving problems where a method calls itself
Recursion relies on the runtime call stack
'every method invocation gets its own stack space
Tail recursion - Correct Answer--Single recursive call thats the last thing performed in
the method
'can easily be turned into a loop
Non-tail recursion - Correct Answer--The recursive call are not performed last in the
method
Recursion vs. Iteration - Correct Answer--Iterative are more efficient
'b/c it avoids the overhead recursive method calls
-Recursive algorithms
'have higher overhead
'sometimes simpler
'are natural for backtracking searches
'suited for recursive data structures
Trees - Correct Answer--Recursive data structure that have a one-to-many relationship
between elements
Root - Correct Answer-No parent
Leaf - Correct Answer-No children
Interior Nodes - Correct Answer-A node with at least one child
Siblings - Correct Answer-Have same parent
Descendants - Correct Answer-Reachable by repeated proceeding from parent to child
Subtree - Correct Answer-A tree whose root is a child
Level - Correct Answer-a measure of a node's distance from the root
Height (or Depth) - Correct Answer-the maximum level of any node in the tree
Binary Tree - Correct Answer-a tree with at most two children per node
