Discrete Math › Section C · Graph theory › Topic C.11
Trees in computing
Open a file, run a database query, type into a search box or play a chess program, and a tree is doing the work. This topic tours the trees inside everyday software and shows how the shape of a tree decides how fast it is, and even how fast any method can be.
In this topic
- Why software loves trees
- Keeping search trees balanced
- Heaps
- Worked example: inserting and removing
- Priority queues and heapsort
- Tries and expression trees
- Worked example: Huffman coding
- Worked example: no sort beats about n log n
- B-trees in databases
- Worked example: a game tree
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…