// File: /workspace/github_c_makefile_star2_O1/CarlosLunaMota[P]BinaryTrees/BinaryTrees.c
// Function: rb_tree_diff
rb_tree *rb_tree_diff(const rb_tree *tree_1, const rb_tree *tree_2) {

    rb_tree *tree = NULL;
    rb_node *pred_1;
    rb_node *node_1;
    rb_node *pred_2;
    rb_node *node_2;
    void    *data;
    int      comp;

    // Sanity check:
    assert(tree_1 != NULL);
    assert(tree_2 != NULL);

    // Create a new tree:
    tree = new_rb_tree(tree_1->comp);
    if (tree == NULL) { return NULL; }

    // Special case: Both trees are the same
    if (tree_1 == tree_2) { return tree; }

    // Special case: tree_1 is empty
    if (rb_tree_is_empty(tree_1) == YES) { return tree; }

    // Go to the smallest element of tree_1 while right-threading your path:
    node_1 = tree_1->root;
    if (node_1 != NULL) {
        while (node_1->left != NULL) {
            pred_1 = node_1->left;
            while (pred_1->right != NULL) { pred_1 = pred_1->right; }
            pred_1->right = node_1;
            node_1        = node_1->left;
        }
    }

    // Go to the smallest element of tree_2 while right-threading your path:
    node_2 = tree_2->root;
    if (node_2 != NULL) {
        while (node_2->left != NULL) {
            pred_2 = node_2->left;
            while (pred_2->right != NULL) { pred_2 = pred_2->right; }
            pred_2->right = node_2;
            node_2        = node_2->left;
        }
    }
    
    // Until we have exhausted at least one of the trees:
    while (node_1 != NULL && node_2 != NULL) {

        // compare both nodes:
        comp = (tree->comp)(node_1->data, node_2->data);

        if (comp < 0) {

            // insert node_1->data in tree /////////////////////////////////////
            data = node_1->data;
            data = rb_tree_insert_max(tree, data);
            assert(data == NULL);
            ////////////////////////////////////////////////////////////////////

            // advance node_1 //////////////////////////////////////////////////
            node_1 = node_1->right;
            if (node_1 != NULL) {
                while (node_1->left != NULL) {
                    pred_1 = node_1->left;
                    while (pred_1->right != NULL && pred_1->right != node_1) {
                        pred_1 = pred_1->right;
                    }
                    if (pred_1->right == NULL) {
                        pred_1->right = node_1;
                        node_1        = node_1->left;
                    } else {
                        pred_1->right = NULL;
                        break;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////

        } else if (comp > 0) {

            // advance node_2 //////////////////////////////////////////////////
            node_2 = node_2->right;
            if (node_2 != NULL) {
                while (node_2->left != NULL) {
                    pred_2 = node_2->left;
                    while (pred_2->right != NULL && pred_2->right != node_2) {
                        pred_2 = pred_2->right;
                    }
                    if (pred_2->right == NULL) {
                        pred_2->right = node_2;
                        node_2        = node_2->left;
                    } else {
                        pred_2->right = NULL;
                        break;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////

        } else {

            // advance node_1 //////////////////////////////////////////////////
            node_1 = node_1->right;
            if (node_1 != NULL) {
                while (node_1->left != NULL) {
                    pred_1 = node_1->left;
                    while (pred_1->right != NULL && pred_1->right != node_1) {
                        pred_1 = pred_1->right;
                    }
                    if (pred_1->right == NULL) {
                        pred_1->right = node_1;
                        node_1        = node_1->left;
                    } else {
                        pred_1->right = NULL;
                        break;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////

            // advance node_2 //////////////////////////////////////////////////
            node_2 = node_2->right;
            if (node_2 != NULL) {
                while (node_2->left != NULL) {
                    pred_2 = node_2->left;
                    while (pred_2->right != NULL && pred_2->right != node_2) {
                        pred_2 = pred_2->right;
                    }
                    if (pred_2->right == NULL) {
                        pred_2->right = node_2;
                        node_2        = node_2->left;
                    } else {
                        pred_2->right = NULL;
                        break;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////
        }
    }

    // Insert all remaining data from tree_1:
    while (node_1 != NULL) {

        // insert node_1->data in tree /////////////////////////////////////////
        data = node_1->data;
        data = rb_tree_insert_max(tree, data);
        assert(data == NULL);
        ////////////////////////////////////////////////////////////////////////

        // advance node_1 //////////////////////////////////////////////////////
        node_1 = node_1->right;
        if (node_1 != NULL) {
            while (node_1->left != NULL) {
                pred_1 = node_1->left;
                while (pred_1->right != NULL && pred_1->right != node_1) {
                    pred_1 = pred_1->right;
                }
                if (pred_1->right == NULL) {
                    pred_1->right = node_1;
                    node_1        = node_1->left;
                } else {
                    pred_1->right = NULL;
                    break;
                }
            }
        }
        ////////////////////////////////////////////////////////////////////////
    }

    // We need to traverse tree_2 completely to restore the modified pointers:
    while (node_2 != NULL) {

        // advance node_2 //////////////////////////////////////////////////////
        node_2 = node_2->right;
        if (node_2 != NULL) {
            while (node_2->left != NULL) {
                pred_2 = node_2->left;
                while (pred_2->right != NULL && pred_2->right != node_2) {
                    pred_2 = pred_2->right;
                }
                if (pred_2->right == NULL) {
                    pred_2->right = node_2;
                    node_2        = node_2->left;
                } else {
                    pred_2->right = NULL;
                    break;
                }
            }
        }
        ////////////////////////////////////////////////////////////////////////
    }

    // Return the resulting tree:
    return tree;
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
testq %rdi, %rdi
je 0xb227
movq %rsi, %r14
testq %rsi, %rsi
je 0xb246
movq %rdi, %r15
movq 0x8(%rdi), %rdi
callq 0x96f9
testq %rax, %rax
je 0xafa0
movq %rax, %rbx
cmpq %r14, %r15
je 0xb21e
movq (%r15), %rax
testq %rax, %rax
je 0xb21e
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xafa7
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
jne 0xaf82
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xaf7c
jmp 0xafaa
xorl %ebx, %ebx
jmp 0xb21e
movq %rax, %r15
movq (%r14), %rax
testq %rax, %rax
je 0xafdf
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xafe4
movq %rcx, %r14
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
jne 0xafc1
movq %rax, 0x10(%rcx)
movq 0x8(%r14), %rcx
movq %r14, %rax
testq %rcx, %rcx
jne 0xafbb
jmp 0xafe7
xorl %r14d, %r14d
jmp 0xafe7
movq %rax, %r14
testq %r14, %r14
je 0xb1c2
movq (%r15), %rdi
movq (%r14), %rsi
callq *0x8(%rbx)
testl %eax, %eax
js 0xb055
je 0xb0b5
movq 0x10(%r14), %r14
testq %r14, %r14
je 0xb150
movq 0x8(%r14), %rax
testq %rax, %rax
je 0xb15c
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb034
cmpq %r14, %rdx
jne 0xb023
addq $0x10, %rax
testq %rdx, %rdx
jne 0xb155
movq %r14, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r14
testq %rax, %rax
jne 0xb01d
jmp 0xb14b
movq (%r15), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r15), %r15
testq %r15, %r15
je 0xb0f5
movq 0x8(%r15), %rax
testq %rax, %rax
je 0xb15c
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb091
cmpq %r15, %rdx
jne 0xb080
addq $0x10, %rax
testq %rdx, %rdx
jne 0xb155
movq %r15, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r15
testq %rax, %rax
jne 0xb07a
movq %rcx, %r15
jmp 0xb15c
movq 0x10(%r15), %rax
testq %rax, %rax
je 0xb0fa
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xb107
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb0de
cmpq %rax, %rdx
jne 0xb0cd
testq %rdx, %rdx
jne 0xb0ff
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xb0c7
jmp 0xb10a
xorl %r15d, %r15d
jmp 0xb15c
xorl %r15d, %r15d
jmp 0xb10a
movq $0x0, 0x10(%rcx)
movq %rax, %r15
movq 0x10(%r14), %r14
testq %r14, %r14
je 0xb150
movq 0x8(%r14), %rax
testq %rax, %rax
je 0xb15c
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb133
cmpq %r14, %rdx
jne 0xb122
addq $0x10, %rax
testq %rdx, %rdx
jne 0xb155
movq %r14, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r14
testq %rax, %rax
jne 0xb11c
movq %rcx, %r14
jmp 0xb15c
xorl %r14d, %r14d
jmp 0xb15c
movq $0x0, (%rax)
testq %r15, %r15
jne 0xafe7
jmp 0xb1c2
movq (%r15), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r15), %rax
testq %rax, %rax
je 0xb1b2
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xb1bf
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb19b
cmpq %rax, %rdx
jne 0xb18a
testq %rdx, %rdx
jne 0xb1b7
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xb184
jmp 0xb1c2
xorl %r15d, %r15d
jmp 0xb1c2
movq $0x0, 0x10(%rcx)
movq %rax, %r15
testq %r15, %r15
jne 0xb167
jmp 0xb219
movq 0x10(%r14), %rax
testq %rax, %rax
je 0xb209
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xb216
movq %rcx, %r14
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xb1f2
cmpq %rax, %rdx
jne 0xb1e1
testq %rdx, %rdx
jne 0xb20e
movq %rax, 0x10(%rcx)
movq 0x8(%r14), %rcx
movq %r14, %rax
testq %rcx, %rcx
jne 0xb1db
jmp 0xb219
xorl %r14d, %r14d
jmp 0xb219
movq $0x0, 0x10(%rcx)
movq %rax, %r14
testq %r14, %r14
jne 0xb1c9
movq %rbx, %rax
popq %rbx
popq %r14
popq %r15
retq
leaq 0x32e8(%rip), %rdi      # 0xe516
leaq 0x2fd8(%rip), %rsi      # 0xe20d
leaq 0x37f9(%rip), %rcx      # 0xea35
movl $0xefc, %edx            # imm = 0xEFC
callq 0x1080
leaq 0x3311(%rip), %rdi      # 0xe55e
leaq 0x2fb9(%rip), %rsi      # 0xe20d
leaq 0x37da(%rip), %rcx      # 0xea35
movl $0xefd, %edx            # imm = 0xEFD
callq 0x1080