|
1 | 1 | # Binary Search Tree |
| 2 | +(Binary trees become truly useful for searching when you balance them) |
2 | 3 |
|
3 | 4 | **What kind of problems are commonly solved via binary search tree:** |
4 | 5 |
|
5 | 6 | - Commonly used in search applications having data entering/leaving in a constant way (e.g., *map*/*set* objects languages libraries. |
| 7 | +- Build binary heaps where higher keys are above or equal to lower ones rather than to the left of (or below or equal to and right). |
| 8 | +- Hash trees, similar to hash tables. |
| 9 | +- Implementing routing table in router. |
| 10 | +- To solve database problem such as indexing. |
| 11 | +- Data compression code. |
| 12 | +- Organization of Morse code. |
| 13 | +- Recursively evaluated mathematical expression. |
| 14 | +- Abstract syntax trees for compilation of computer languages. |
| 15 | +- Huffman trees for compression of data. |
| 16 | +- Routing trees for network traffic. |
0 commit comments