> merging them in a tree-like computational graph implies O(log n) merges. Intuitively this doesn't make sense to me. You have a tree that has N leaves, and yo

> merging them in a tree-like computational graph implies O(log n) merges. Intuitively this doesn't make sense to me. You have a tree that has N leaves, and you have to perform a merge for each parent. There are however N-1 parents, so you'll still perform O(N) merges.