public int computeIndex() {
			Node cur = this;
			int index = sizeLeft;
			while (cur.parent != null) {
				if (cur.parent.rChild == cur) {
					index++;
					index += cur.parent.sizeLeft;
				}
				cur = cur.parent;
			}
			return index;
		}
Compute this node's index.

This uses the {@link #sizeLeft} field to compute the index in O(log n) on average.

@return the index
Ghidra/Framework/Generic/src/main/java/ghidra/generic/util/datastruct/TreeValueSortedMap.java