build this tree

    |-D
 |-A|
 |  |-E
 |
 |
 |     |-F
 |  |-H|
 |  |  |-G
R|-B|
 |  |
 |  |-I
 |
 |   
 |  |-J|-L
 |-C|
    |
    |  |-M
    |-K|
       |-N


disconnect B and connect it on C
disconnect B and connect it to A

disconnect object B and reconnect it on L
disconnect all B subtree and rebuild it on L


1 disconnect B   
2 connect subtree B to A
3 disconnect A
4 connect subtree B to C
5 connect subtree A to C
6 sort A (does it make the index of B appear?)


