Not really; I mean the algorithms are quite involved, there is no real short idea you can remember instead. If you consider slides 106 and 107, you see the different cases, and each one can be explained. For constrain, it is not soo difficult, since you either forward the recursive call or just use one of the recursive calls on case the other cofactor is the 0-leaf.