Recursive Graphs! The rule consists of 3 bytes: First bite says whether a node has an edge to left/ straight up/right if it has one incoming branch. The second byte is for two incoming edges and the last for three.
(I also wrote the mirrored rule, since I won't draw that extra)
Last picture is the biggest my kid drew, spiced with more complicated extra rules.











