The following are some general ideas on crossover and mutation for binary encoding and tree encoding. The binary string from beginning of parent 1 to its crossover point is copied to the new offspring on the same positions. See example below. The binary string from beginning of parent 1 to its first crossover point and the binary string from its second crossover point to its end are copied to the new offspring. See example below.
Bits are randomly copied from the first or from the second parent to the new offspring.
See example below. See example below. The simplest way to do binary encoded mutation is to flip the bits. Tree encoded crossover works just like single-point binary encoded crossover. In both parent one crossover point is selected.