Skip to content

Backend / Algorithms & data structures / 04_trees/

Trees

index source

This folder has no README. Everything inside it is listed below.

Notes

Tree traversals — DFS and BFS 4 Almost every tree problem reduces to "visit nodes in some order and accumulate." Pick the right traversal and most of the work is done.
BSTs and tries 6 Two structures with distinct interview roles: BSTs test whether you understand an invariant, tries test whether you recognise a prefix problem.