required (hard)helpful (soft)NumberComputational FluencyPatterns & AlgebraGeometry & MeasurementData & ProbabilityCalculusComputer ScienceFinancial LiteracyLife ScienceChemistryPhysicsEarth & Space ScienceEnvironmental ScienceScience PracticesPhonics & FoundationsReading & ComprehendingVocabulary & Word StudyGrammar & ConventionsWriting & CreatingLiterature & AnalysisOral & Spoken Language
Target↳ Tracing the call stackRecursive Problem SolvingG12
↳ Stack, heap and lifetimeAccess Variables in MemoryG12
↳ Stacks and queuesWays in Which Data Structures Are Organized in MemoryG12
↳ The recursive call must shrink the problemRecursive Problem SolvingG12
↳ Linked structures: nodes and pointersWays in Which Data Structures Are Organized in MemoryG12
↳ Aliasing, shallow copy, deep copyAccess Variables in MemoryG12
↳ The base caseRecursive Problem SolvingG12
↳ Value vs referenceAccess Variables in MemoryG12
↳ Arrays are contiguousWays in Which Data Structures Are Organized in MemoryG12
↳ What a function can change about your dataAccess Variables in MemoryG12
↳ Spotting a self-similar problemRecursive Problem SolvingG12
Press enter or space to select a node. You can then use the arrow keys to move the node around. Press delete to remove it and escape to cancel.
Press enter or space to select an edge. You can then press delete to remove it or escape to cancel.
learn the items on the left, then this · hover a card to trace its chain · click a lessoned card to open it