#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ testAddNode();
int /*<<< orphan*/ testContainsBSTree();
int /*<<< orphan*/ testLeftMost();
int /*<<< orphan*/ testRemoveLeftMost();
int /*<<< orphan*/ testRemoveNode();
int main(int argc, char *argv[]) {
  testAddNode();
  printf("\n");
  testContainsBSTree();
  printf("\n");
  testLeftMost();
  printf("\n");
  testRemoveLeftMost();
  printf("\n");
  testRemoveNode();
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    %edi,-0x8(%rbp)
mov    %rsi,-0x10(%rbp)
mov    $0x0,%al
call   1040 <testAddNode@plt>
lea    0xe7c(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1030 <testContainsBSTree@plt>
lea    0xe69(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1070 <testLeftMost@plt>
lea    0xe56(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1060 <testRemoveLeftMost@plt>
lea    0xe43(%rip),%rdi
call   1050 <printf@plt>
mov    $0x0,%al
call   1080 <testRemoveNode@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
xor    %eax,%eax
call   1050 <testAddNode@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
call   1040 <testContainsBSTree@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
call   1070 <testLeftMost@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
call   1060 <testRemoveLeftMost@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
call   1080 <testRemoveNode@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [2 x i8] c"\0A\00"
define i32 @main(i32 %0, i8** %1) {
%3 = alloca i32
%4 = alloca i32
%5 = alloca i8**
store i32 0, i32* %3
store i32 %0, i32* %4
store i8** %1, i8*** %5
%6 = call i32 (...) @testAddNode()
%7 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%8 = call i32 (...) @testContainsBSTree()
%9 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%10 = call i32 (...) @testLeftMost()
%11 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%12 = call i32 (...) @testRemoveLeftMost()
%13 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%14 = call i32 (...) @testRemoveNode()
ret i32 0
}

LLVM IR (-O2):
define i32 @main(i32 %0, i8** nocapture readnone %1) {
%3 = tail call i32 (...) @testAddNode()
%4 = tail call i32 @putchar(i32 10)
%5 = tail call i32 (...) @testContainsBSTree()
%6 = tail call i32 @putchar(i32 10)
%7 = tail call i32 (...) @testLeftMost()
%8 = tail call i32 @putchar(i32 10)
%9 = tail call i32 (...) @testRemoveLeftMost()
%10 = tail call i32 @putchar(i32 10)
%11 = tail call i32 (...) @testRemoveNode()
ret i32 0
}