// File: /workspace/github_c_makefile_star2_O1/CarlosLunaMota[P]BinaryTrees/BinaryTrees.c
// Function: rb_tree_union
rb_tree *rb_tree_union(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);

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

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

    // 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) {

            // insert node_2->data in tree /////////////////////////////////////
            data = node_2->data;
            data = rb_tree_insert_max(tree, data);
            assert(data == 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;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////

        } else {

            // 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;
                    }
                }
            }
            ////////////////////////////////////////////////////////////////////

            // 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;
                }
            }
        }
        ////////////////////////////////////////////////////////////////////////
    }

    // Insert all remaining data from tree_2:
    while (node_2 != NULL) {

        // insert node_2->data in tree /////////////////////////////////////////
        data = node_2->data;
        data = rb_tree_insert_max(tree, data);
        assert(data == 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 0xab9c
movq %rsi, %r14
testq %rsi, %rsi
je 0xabbb
movq %rdi, %r15
cmpq %r14, %rdi
je 0xa8d2
movq 0x8(%r15), %rdi
callq 0x96f9
testq %rax, %rax
je 0xa8df
movq %rax, %rbx
movq (%r15), %rax
testq %rax, %rax
je 0xa8e6
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xa8eb
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
jne 0xa8b4
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xa8ae
jmp 0xa8ee
movq %r15, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x9753
xorl %ebx, %ebx
jmp 0xab93
xorl %r15d, %r15d
jmp 0xa8ee
movq %rax, %r15
movq (%r14), %rax
testq %rax, %rax
je 0xa923
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xa928
movq %rcx, %r14
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
jne 0xa905
movq %rax, 0x10(%rcx)
movq 0x8(%r14), %rcx
movq %r14, %rax
testq %rcx, %rcx
jne 0xa8ff
jmp 0xa92b
xorl %r14d, %r14d
jmp 0xa92b
movq %rax, %r14
testq %r15, %r15
sete %al
testq %r14, %r14
sete %cl
orb %al, %cl
jne 0xab2c
movq (%r15), %rdi
movq (%r14), %rsi
callq *0x8(%rbx)
testl %eax, %eax
js 0xa9af
je 0xaa0f
movq (%r14), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r14), %r14
testq %r14, %r14
je 0xaab5
movq 0x8(%r14), %rax
testq %rax, %rax
je 0xaac1
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xa98e
cmpq %r14, %rdx
jne 0xa97d
addq $0x10, %rax
testq %rdx, %rdx
jne 0xaaba
movq %r14, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r14
testq %rax, %rax
jne 0xa977
jmp 0xaab0
movq (%r15), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r15), %r15
testq %r15, %r15
je 0xaa5a
movq 0x8(%r15), %rax
testq %rax, %rax
je 0xaac1
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xa9eb
cmpq %r15, %rdx
jne 0xa9da
addq $0x10, %rax
testq %rdx, %rdx
jne 0xaaba
movq %r15, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r15
testq %rax, %rax
jne 0xa9d4
movq %rcx, %r15
jmp 0xaac1
movq (%r15), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r15), %rax
testq %rax, %rax
je 0xaa5f
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xaa6c
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xaa43
cmpq %rax, %rdx
jne 0xaa32
testq %rdx, %rdx
jne 0xaa64
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xaa2c
jmp 0xaa6f
xorl %r15d, %r15d
jmp 0xaac1
xorl %r15d, %r15d
jmp 0xaa6f
movq $0x0, 0x10(%rcx)
movq %rax, %r15
movq 0x10(%r14), %r14
testq %r14, %r14
je 0xaab5
movq 0x8(%r14), %rax
testq %rax, %rax
je 0xaac1
movq %rax, %rcx
movq %rax, %rdx
movq %rdx, %rax
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xaa98
cmpq %r14, %rdx
jne 0xaa87
addq $0x10, %rax
testq %rdx, %rdx
jne 0xaaba
movq %r14, (%rax)
movq 0x8(%rcx), %rax
movq %rcx, %r14
testq %rax, %rax
jne 0xaa81
movq %rcx, %r14
jmp 0xaac1
xorl %r14d, %r14d
jmp 0xaac1
movq $0x0, (%rax)
testq %r15, %r15
je 0xab2c
testq %r14, %r14
jne 0xa93f
jmp 0xab2c
movq (%r15), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r15), %rax
testq %rax, %rax
je 0xab1c
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xab29
movq %rcx, %r15
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xab05
cmpq %rax, %rdx
jne 0xaaf4
testq %rdx, %rdx
jne 0xab21
movq %rax, 0x10(%rcx)
movq 0x8(%r15), %rcx
movq %r15, %rax
testq %rcx, %rcx
jne 0xaaee
jmp 0xab2c
xorl %r15d, %r15d
jmp 0xab2c
movq $0x0, 0x10(%rcx)
movq %rax, %r15
testq %r15, %r15
jne 0xaad1
jmp 0xab8e
movq (%r14), %rsi
movq %rbx, %rdi
callq 0x9835
movq 0x10(%r14), %rax
testq %rax, %rax
je 0xab7e
movq 0x8(%rax), %rcx
testq %rcx, %rcx
je 0xab8b
movq %rcx, %r14
movq %rcx, %rdx
movq %rdx, %rcx
movq 0x10(%rdx), %rdx
testq %rdx, %rdx
je 0xab67
cmpq %rax, %rdx
jne 0xab56
testq %rdx, %rdx
jne 0xab83
movq %rax, 0x10(%rcx)
movq 0x8(%r14), %rcx
movq %r14, %rax
testq %rcx, %rcx
jne 0xab50
jmp 0xab8e
xorl %r14d, %r14d
jmp 0xab8e
movq $0x0, 0x10(%rcx)
movq %rax, %r14
testq %r14, %r14
jne 0xab33
movq %rbx, %rax
popq %rbx
popq %r14
popq %r15
retq
leaq 0x3973(%rip), %rdi      # 0xe516
leaq 0x3663(%rip), %rsi      # 0xe20d
leaq 0x3e0b(%rip), %rcx      # 0xe9bc
movl $0xd58, %edx            # imm = 0xD58
callq 0x1080
leaq 0x399c(%rip), %rdi      # 0xe55e
leaq 0x3644(%rip), %rsi      # 0xe20d
leaq 0x3dec(%rip), %rcx      # 0xe9bc
movl $0xd59, %edx            # imm = 0xD59
callq 0x1080