Example of a ranked binary tree d 1(e 0(a)1 0(C)1 If all rank differences positive, rank> heightExample of a ranked binary tree If all rank differences positive, rank  height f 1 1 e 1 d b 2 a 1 c 1 1 0 0 0 1