See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Visiting every node in a structure in a specific order
Each node listed with all nodes directly connected to it
2D array with 1s (edge exists) and 0s (no edge)
Explores far along each path before backtracking
Explores all nodes at current distance before moving further
Tree where each node has at most two children
Visit, left, right
Left, visit, right
Left, right, visit
Defines when recursive function stops calling itself
Select your subjects, and get access to A+ resources today.