Though balanced trees are natural with bottom-up computation of TreeLSTMs, for GCNs they would result in embedding essentially random subsets of words.
we compare only to left-to-right chains of dependencies.