| Trees in computer science | |
|---|---|
| Binary trees | |
| Self-balancing binary search trees | |
| B-trees | |
| Tries | |
| Binary space partitioning (BSP) trees | |
| Non-binary trees | |
| Spatial data partitioning trees | |
| Other trees | |
It is easier to write an incorrect program than understand a correct one.
| Trees in computer science | |
|---|---|
| Binary trees | |
| Self-balancing binary search trees | |
| B-trees | |
| Tries | |
| Binary space partitioning (BSP) trees | |
| Non-binary trees | |
| Spatial data partitioning trees | |
| Other trees | |
No comments:
Post a Comment