Am I right in thinking that: • the abstract running time of sum-tree is 2n–1, where n is the number of numbers in the tree; • the worst possible shape of the tree is one that has many numbers; • and the best possible shape of the tree is one that has only one number, at its root?