Tree is one of the most powerful data structures, and it is present in various kinds of problems. I want to show you how trees helped me design certain solutions so that you can do the same when the right time comes.
A B C D E A requires B and C B requires D and E E requires F and G ...but D and E can’t confirm before B, F and G must wait for E, so... Who can vote? Did vote pass? F G
A B C D E Check B and C, when in B check D and E, when in E check F and G… and if something failed somewhere then return all the information down. F G failed