Trees
Hierarchical structures with one route to each node.
2 subjects · 5 topics · 2 cheatsheets
Subjects covering this category
2 subjects- Subject · Beginner to Advanced
Choosing a data structure by the cost of its operations, and implementing arrays, linked lists, stacks, queues, hash tables, trees, heaps, tries and graphs in Python, Java and TypeScript.
- Measuring Cost
- Sequences and Lookup
- Recursion and Trees
- Subject · Intermediate to Advanced
Recognising which of the common problem-solving patterns an unseen coding problem needs, and solving it in Python, Java or TypeScript within the time an interview allows.
- Approach
- Array and Number Patterns
- Linked List Patterns
Cheatsheets
2 cheatsheets- Cheatsheet · Data Structures
Every data structure in the subject on one page: what each one is for, what its operations cost, and how to choose.
- Cheatsheet · Coding Interview Patterns
Fourteen coding interview patterns on one page: the property that points to each, what it costs, when it fails, and its loop in Python.
In Trees itself
5 topics- Data Structures
Binary Search Trees: keeping keys in order so that search, insert and delete each follow one path, and why insertion order decides the cost.
Beginner to Advanced9 cards · 6 qnot started
- Data Structures
Heaps: a complete binary tree stored in an array that always gives the smallest or largest item first, the data structure behind every priority queue.
Beginner to Intermediate9 cards · 5 qnot started
- Data Structures
Binary Trees: naming the parts of a tree, traversing it in four orders, counting height in edges, and writing functions that combine two subtrees' answers.
Beginner to Intermediate8 cards · 4 qnot started
- Coding Interview Patterns
Tree patterns: solving binary tree problems by passing values down or returning them up, level by level, or through both subtrees at once.
Intermediate to Advanced8 cards · 4 qnot started
- Data Structures
Tries: a tree with one node per letter, which answers whether any stored word starts with a prefix in time that ignores how many words there are.
Beginner to Intermediate7 cards · 3 qnot started