In this web content, the author discusses the concepts of binary search trees (BSTs) and B-trees. BSTs are data structures where each node contains a key value and two pointers to left and right nodes. The author notes that BSTs can become unbalanced and less effective if too many values are added to one side. On the other hand, B-trees are like thicker binary trees, with each node containing multiple keys and pointers. The author then describes their attempt to implement a B-tree in the game Factorio, showcasing the structure and functionality of both BSTs and B-trees in the game. The author invites suggestions for improving their factory setup.
https://razberry.substack.com/p/btree-factorio