Where Is It?
To locate it in an unsorted list you can use this brute force search method
What is the Linear or Sequential Search?
Items are added and deleted from this end only in a stack
What is the top?
Every binary tree node stores this many links
What is two?
A linked list is a collection of items called this
What is node?
A function that calls itself is known as this
What is a recursive?
To locate it in a sorted list you can use this search method
What is the Binary Search?
What LIFO stands for
What is Last In, First Out?
A binary tree node that has no left or right children is called this term
What is a leaf (or external node)?
What the pointer head points to in a linked list
What is the first node in the linked list?
Every recursive definition must have at least one of these
What is base case?
To find the key using this method involves a fixed-size table
What is hashing?
To pop a stack means this
What is remove an item from the top of the stack?
The binary tree traversal algorithm where the last node visited is the root of the tree
What is postorder?
What it means when a linked list node’s pointer field is None
What is it is the last node of the list?
The general case of a recursive definition must eventually reduce to this
What is a base case?
If using this collision handling method, you will find it in a linked list
What is chaining?
What the top method of a stack class does
What is return the value at the top of the stack?
In this type of binary tree traversal, the left subtree is visited after the node.
What is preorder?
The performance of pushing onto a stack is Big-Oh what?
What is O(1)?
Most problems that have a recursive solution also have an iterative solution which uses this control structure
What is a loop?
Because of stacks, this type of notation does not require the use of parentheses to enforce operator precedence
What is postfix?
A binary tree in which the key in the root node is larger than every key in the left subtree and smaller than every key in the right subtree is called this
What is a binary search tree?
Of inserting an item into a linked list or inserting an item into an array, the one that is more efficient
What is inserting an item into a linked list?
Recursive function calls are resolved using this type of data structure
What is a stack?