Proof: We prove this in two steps: First, we show thatthe two properties mentioned above hold for any tree withminimum average depth; Second, based on this observation,we prove that both our tree and a tree with minimum depthhave the same average depth.We prove the first by contradiction. Assume there existsa tree A that does not have the two properties but is ofminimum average depth. Apparently, A must be a balancedtree; otherwise we can use low-delay-jump to reduce itsaverage depth. Now consider that A violates the the secondproperty, i.e., there must be at least one node x whose outdegree is smaller than another node y but is closer to theroot. We first consider the case that y is a descendant of x, asshown in Fig. 10. In this case, we can swap nodes x and y,with y still serving its other children (node z in Fig. 10). Thisoperation reduces the average depth, which contradicts to theassumption that A has minimized average depth. For the casethat y is not x’s descendant, we can first swap y with one
đang được dịch, vui lòng đợi..
