Data Structures
This data structure use FIFO.
what is queue?
This term describes a method that calls itself to solve a problem.
What is recursion?
This is the level of the top node in a tree
What is Level 1?
This is the best time complexity.
What is 0(1)?
You can use this to travel forward and back in a data structure.
What is an Iterator?
This is the backing data structure for Stacks and Queues
What is Linked list?
The simplest input or scenario that a recursive function can directly solve without further recursion or inductive steps.
What is the base case?
This term refers to the number of levels from the root to the farthest leaf node.
What is height?
This is the time complexity of a recursive function.
What is O(n)?
These four data structures can be made circular.
What is ArrayList, Linked List, Stack and Queue?
This is what a memory location in a LinkedList called.
what is a node?
Calculating the factorial of a number can be done recursively. This is the value of 3!
What is 6?
A tree where every internal node has exactly two children, and all leaf nodes are at the same level.
What is a perfect tree?
O(log n) is the time complexity for this type of tree.
What is a balanced binary search tree?
This is how Biconsumer is defined.
Two parameters that get used and deleted (void return)
This Stack method returns the argument
What is push()?
A recursive function without a proper base case can lead to this type of never-ending issue.
What is infinite recursion?
A tree used for data compression, where numbers represent characters.
What is a Huffman tree?
This is the time complexity of removing a node in an unbalanced binary search tree.
What is O(n)?
This is the minimum amount of absrtact methods that you can have in a functional interface.
What is 1?
This iterator method returns true if there are more elements in the data structure.
what is hasNext()
This sequence, defined recursively as F(n) = F(n-1) + F(n-2), starts with 0 and 1.
What is the Fibonacci sequence?
Both of these tree types have at most two children per node, but one is specifically ordered to optimize searching.
What is the difference between a Binary Tree and a Binary Search Tree?
O(1) is the time complexity when you do this to a queue implemented using a linked list.
What is enqueuing?
This is the number of times Erb has talked about himself rather than teaching what is in the curriculum.
April Fools, the number is too high to count so you get the points.