Scribd
Upload
18 views2 pages

Cs106B CheatSheet 2

The document outlines various programming concepts and techniques, including recursion, backtracking, and data structures such as trees and linked lists. It emphasizes the importance of handling edge cases and memory management in coding practices. Additionally, it mentions utility header files and algorithms related to hashing and tree traversal methods.

Uploaded by

Koichi K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

Cs106B CheatSheet 2

The document outlines various programming concepts and techniques, including recursion, backtracking, and data structures such as trees and linked lists. It emphasizes the importance of handling edge cases and memory management in coding practices. Additionally, it mentions utility header files and algorithms related to hashing and tree traversal methods.

Uploaded by

Koichi K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Optional :value() to access ii.

Chemo iii Shrinkable #I


i Word Walk
.

is inflate trees
Hella Recursion
i .
Collection Point Ollogn)

Backtracking Optimization
i Cosmic Care
:

.
Pkg

iii WinSumloseSum (backtracking)

iv. Spaghettify
ii
.
Unbiased ir. Shrinkable Word I

Subsets Combinations
-

Backtrack strats:

-
Permutations

Structs: TIPS
is
delete => clears
memory but
·
,

doesn't make (garbage


nullptr value (
· while (curr != nullptr)
handle
edge cases for nodes
·

& trees carefully !


·

O(n)0(nlogn) = similar

·
calling delete() on a nullptr
is OK.
Hashing Merge Algorithm Inorder Traversal

Ja

& Post-order
&

·: declare in
private
Robinhood:

Utility header files randomh & stringh

BST

Perfect: ·
array
declaration
no
To Slot struct
[] !
I
Linked List Append

·the ·
subsidetostaoo
if is
, =
Linked List Recursion

terniary conditions ·
isUpper E isLower & isAlpha

You might also like