Casually reading through Greg Restall's book on substructural logics, I came across a curious line:
"However, proofs are not so easy to construct in tree form - often it is easier to construct proofs writing the consecutions in a list."
Personally, I have always found the "list" way of constructung proofs to be rather arbitrary and nonintuitive. If I have access to a sequent(esque) system, then I invariably construct the proof by doing a backwards "proof search". But maybe that is because I cut my (logical) teeth by working on theorem proving software.
I'm interested in seeing what method other people prefer, so leave a comment if you have a preference!