Show:
What's my Runtime?
DataStructures
Trees
Misc.
Know your TAs!
100
Depth First Search
What is O(M+N)?
100

Stacks are used in this graph search algorithm

Depth First Search

100
A traversal that goes "left right print"

post order

100

The key difference between arrays and arraylists

Arraylists can be changed!

100

Arushi's height (+- 1 inch acceptable)

What is 5'4 

200

Merge Sort

O(NlogN)

200

An alphabetized collection with no duplicates

Treeset

200

Traversal which returns a sorted output on a binary search tree

What is in order?

200

How is Djikstra's algorithm different from normal BFS?

What are weighted edges?

200

Noah's high school sport

What is running/cross country/track?

300
Recurrence Relation for Searching in a Binary Tree

What is T(N) = 2T(N/2)+O(1)?

300
Constant time lookup for this data structure

What is a hashset?

300

Trees that can balance itself

What are red black trees?

300
This method is called within the .hashcode method

what is .equals

300
Arushi and Noah's graduating years

What are

Arushi '23

Noah '25

400

Selection Sort in the Worst Case.

O(N²)

400

A map where the keys are vertices and values are sets of vertices they are connected to

What is an adjacency list?

400

Runtime to do a search on a NON BINARY SEARCH TREE

O(N)

400

Interface using CompareTo

Comparable

400

The amount of semesters Noah has TAed for, including this one

What is 1?
500
Writing a method halts? that returns true if and only if a function halts on an argument

Impossible!

500

Two conditions required for a  heap

What are the shape property (full) and heap property (all greater/less than prev)?

500

2 Typical Base Cases for Tree Recursion

What are leaves and null trees?

500

Runtime of the .length() method for a list of length M

O(1)

500

The name of Arushi's dance group

What is defining movement?