Transactions tree not list?
In your example, there will be two chains of transactions as different transactions are spending the outputs of one transaction. Because there are two distinct transactions spending from those two outputs, there are now two transaction chains coming from one transaction. However this does not mean that the transaction chains won't converge or meet. Calling it a transaction chain or a tree isn't really accurate. It's actually a directed acyclic graph.