CMSC132 Exam #2(Errorless solutions)

Recursion correct answers 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 answers -Single recursive call thats the last thing performed in the method 'can easily be turned into a loop Non-tail recursion correct answers -The recursive call are not performed last in the method Recursion vs. Iteration correct answers -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 answers -Recursive data structure that have a one-to-many relationship between elements Root correct answers No parent Leaf correct answers No children Interior Nodes correct answers A node with at least one child Siblings correct answers Have same parent Descendants correct answers Reachable by repeated proceeding from parent to child Subtree correct answers A tree whose root is a child Level correct answers a measure of a node's distance from the root Height (or Depth) correct answers the maximum level of any node in the tree Binary Tree correct answers a tree with at most two children per node Depth-First Traversal (DFS) correct answers visits nodes as far ahead as possible before backing up Preorder Traversal correct answers visits a parents node before its left and right children