Rank Groups and the Rank of a Node
	• Recall that we kept track of the size (weight) of each tree Definition of rank(v) – For a root node v, rank(v) is defined to be ëlog(size(v))û – For a nonroot node w, rank(w) is defined to be the largest rank achieved by w before it became a nonroot				Definition: Nodes u and v are in rank group g if log*(rank(u)) = log*(rank(v)) = g • Note that – nodes can be in the same rank group even when their ranks are different – the largest possible rank group is log*(ëlog nû) = log*n - 1
			CS409 - Spring 2000					10