CSCI2100 · 2
Chapter outline · Linear data structures
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 3 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
A FIFO queue built from two stacks
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Finding a linked-list cycle without a visited set
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
A queue from two stacks: FIFO invariants and amortized cost
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.