with these numbers
Code:
nums[] = {9, 5, 10, 1, 7, 8};
after the double right rotation i get

Code:
parent->left <= 0 'double rotate right'
node data = 1 (0)
searching left child of 5
node data = 5 (-1)
searching left child of 7
node data = 7 (0)
node data = 8 (0)
searching left child of 9
node data = 9 (2)
node data = 10 (0)
searching right child of 9
searching right child of 7
        .---1
    .---5
---7
   |    .---8
    `---9
        `---10

there are 6 nodes in the tree

node deleted
node deleted
node deleted
node deleted
node deleted
node deleted

Process returned 0 (0x0)   execution time : 0.001 s
Press ENTER to continue.
it still doesnt seem to update the balance factor of each node after the rotation despite putting differences(*root); at the end of every rotate function