Back to marketplace

Section 8 Chapter 44 - Recursive Algorithms

No description yet. This curated deck is ready for daily study.

Total cards: 9•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (9)

#1
Front (Question)

Recursion

Back (Answer)

An algorithm or subroutine that is defined in terms of itself

#2
Front (Question)

Characteristics of a recursive algorithm (3)

Back (Answer)

• A stopping condition / base case that when met will return a value not determined by calling itself again • For other input values the algorithm must call itself • The stopping condition must be reached after a finite number of calls

#3
Front (Question)

How to store a binary tree if you were gonna program with it

Back (Answer)

A list of records. Each record holds the left branch index, right branch index and the data

#4
Front (Question)

Pseudocode for in-order traversal

Back (Answer)

Traverse left subtree Visit this node (the parent of the two subtrees) Traverse right subtree

#5
Front (Question)

Pseudocode for pre-order traversal

Back (Answer)

Visit this node (the parent of the two subtrees) Traverse left subtree Traverse right subtree

#6
Front (Question)

Pseudocode for post-order traversal

Back (Answer)

Traverse left subtree Traverse right subtree Visit this node (the parent of the two subtrees)

#7
Front (Question)

Use of a pre order traversal

Back (Answer)

Copying a tree

#8
Front (Question)

Use of an in order traversal

Back (Answer)

Outputting the contents of a binary search tree in ascending order

#9
Front (Question)

Use of a post order traversal (2)

Back (Answer)

Converting infix to postfix (Reverse Polish Notation), emptying a tree