TODO.done (700B)
1 Done TODOs 2 ========== 3 4 [x] Fix SEGV 5 - It seems that free(root) after free_node(&root) does this 6 7 [/] Check if everything can be done without reading the entire input 8 and without actual structs; indent seems like it can be enough for 9 that 10 - Unfortunately, I don't see any other way to have a 11 distinction between '`' and '+' besides having two passes, 12 one for reading the input and the other for output, because 13 there needs to be a way to know when a group of node's 14 children ends. (Maybe with seek/rewind, but that can't be 15 done for stdin, so the code would need to account for both 16 cases.) 17 - Now looking at tree(1)'s source, it also creates a tree in 18 memory.