#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 */
struct node {
  int dummy;
};

/* Variables and functions */
int /*<<< orphan*/ allSkews(struct node *, int *, int /*<<< orphan*/);
int anotherSumOfTree(struct node *, int /*<<< orphan*/);
struct node *createTree(int);
int /*<<< orphan*/ display(struct node *);
scalar_t__ find(struct node *, int);
int /*<<< orphan*/ free(struct node *);
int heightOfTree(struct node *, int /*<<< orphan*/);
int /*<<< orphan*/ insert(struct node *, int);
int largestSum(struct node *, int /*<<< orphan*/);
int noOfFullNodes(struct node *, int /*<<< orphan*/);
int noOfHalfNodes(struct node *, int /*<<< orphan*/);
int /*<<< orphan*/ printLeaves(struct node *);
int /*<<< orphan*/ printf(char *, ...);
int sumOfTree(struct node *, int /*<<< orphan*/);
int totalElements(struct node *, int /*<<< orphan*/);
void main() {
  struct node *head = createTree(20);
  int a[100];
  insert(head, 10);
  insert(head, 5);
  insert(head, 30);
  insert(head, 15);
  if (find(head, 35))
    printf("ele found\n");
  else
    printf("ele not found\n");
  insert(head, 35);
  insert(head, 7);
  insert(head, 25);
  insert(head, 6);
  insert(head, 18);
  insert(head, 17);
  insert(head, 16);
  if (find(head, 35))
    printf("ele found\n");
  else
    printf("ele not found\n");
  printf("\n");
  printf("Leaf Nodes are\n");
  printLeaves(head);
  printf("\n");
  printf("Total nodes = %d\n", totalElements(head, 0));
  printf("\n");
  printf("Height of the tree = %d\n", heightOfTree(head, 0));
  printf("\n");
  printf("in-order traversal of tree\n");
  display(head);
  printf("\n");
  printf("Number of Full Nodes = %d\n", noOfFullNodes(head, 0));
  printf("Number of Half Nodes = %d\n", noOfHalfNodes(head, 0));
  printf("Largest Sum of a skew = %d\n", largestSum(head, 0));
  printf("Skew Paths from root to leaves\n");
  allSkews(head, a, 0);
  printf("Sum of tree = %d\n", sumOfTree(head, 0));
  printf("Sum of tree in a different way = %d\n", anotherSumOfTree(head, 0));
  free(head);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x1a0,%rsp
mov    $0x14,%edi
call   1040 <createTree@plt>
mov    %rax,-0x8(%rbp)
mov    -0x8(%rbp),%rdi
mov    $0xa,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x5,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x1e,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0xf,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x23,%esi
call   10c0 <find@plt>
cmp    $0x0,%rax
je     126c <main+0x7c>
lea    0xda0(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
jmp    127a <main+0x8a>
lea    0xd98(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
mov    $0x23,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x7,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x19,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x6,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x12,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x11,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x10,%esi
call   10e0 <insert@plt>
mov    -0x8(%rbp),%rdi
mov    $0x23,%esi
call   10c0 <find@plt>
cmp    $0x0,%rax
je     1307 <main+0x117>
lea    0xd05(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
jmp    1315 <main+0x125>
lea    0xcfd(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xd37(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xcf0(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1080 <printLeaves@plt>
lea    0xd12(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   10d0 <totalElements@plt>
mov    %eax,%esi
lea    0xcce(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xce9(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   1100 <heightOfTree@plt>
mov    %eax,%esi
lea    0xcb7(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xcc0(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xcb4(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1070 <display@plt>
lea    0xc9b(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   10b0 <noOfFullNodes@plt>
mov    %eax,%esi
lea    0xc9e(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   1050 <noOfHalfNodes@plt>
mov    %eax,%esi
lea    0xc9e(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   10a0 <largestSum@plt>
mov    %eax,%esi
lea    0xc9e(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
lea    0xcac(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
lea    -0x1a0(%rbp),%rsi
xor    %edx,%edx
call   1110 <allSkews@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   10f0 <sumOfTree@plt>
mov    %eax,%esi
lea    0xc9f(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
xor    %esi,%esi
call   1060 <anotherSumOfTree@plt>
mov    %eax,%esi
lea    0xc96(%rip),%rdi
mov    $0x0,%al
call   1090 <printf@plt>
mov    -0x8(%rbp),%rdi
call   1030 <free@plt>
add    $0x1a0,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %r15
push   %r14
push   %rbx
sub    $0x190,%rsp
mov    $0x14,%edi
call   1040 <createTree@plt>
mov    %rax,%rbx
mov    %rax,%rdi
mov    $0xa,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x5,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x1e,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0xf,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x23,%esi
call   10e0 <find@plt>
test   %rax,%rax
lea    0xe40(%rip),%r15
lea    0xe90(%rip),%r14
mov    %r14,%rdi
cmove  %r15,%rdi
call   1070 <puts@plt>
mov    %rbx,%rdi
mov    $0x23,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x7,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x19,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x6,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x12,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x11,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x10,%esi
call   1100 <insert@plt>
mov    %rbx,%rdi
mov    $0x23,%esi
call   10e0 <find@plt>
test   %rax,%rax
cmove  %r15,%r14
mov    %r14,%rdi
call   1070 <puts@plt>
mov    $0xa,%edi
call   1050 <putchar@plt>
lea    0xdb3(%rip),%rdi
call   1070 <puts@plt>
mov    %rbx,%rdi
call   10a0 <printLeaves@plt>
mov    $0xa,%edi
call   1050 <putchar@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   10f0 <totalElements@plt>
lea    0xcc9(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    $0xa,%edi
call   1050 <putchar@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   1120 <heightOfTree@plt>
lea    0xcb7(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    $0xa,%edi
call   1050 <putchar@plt>
lea    0xd5c(%rip),%rdi
call   1070 <puts@plt>
mov    %rbx,%rdi
call   1090 <display@plt>
mov    $0xa,%edi
call   1050 <putchar@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   10d0 <noOfFullNodes@plt>
lea    0xc8e(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   1060 <noOfHalfNodes@plt>
lea    0xc8f(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   10c0 <largestSum@plt>
lea    0xc90(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
lea    0xd0b(%rip),%rdi
call   1070 <puts@plt>
mov    %rsp,%rsi
mov    %rbx,%rdi
xor    %edx,%edx
call   1130 <allSkews@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   1110 <sumOfTree@plt>
lea    0xc79(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    %rbx,%rdi
xor    %esi,%esi
call   1080 <anotherSumOfTree@plt>
lea    0xc71(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   10b0 <printf@plt>
mov    %rbx,%rdi
call   1030 <free@plt>
add    $0x190,%rsp
pop    %rbx
pop    %r14
pop    %r15
ret

LLVM IR (-O0):
%struct.node = type { i32 }
@.str = [11 x i8] c"ele found\0A\00"
@.str.1 = [15 x i8] c"ele not found\0A\00"
@.str.2 = [2 x i8] c"\0A\00"
@.str.3 = [16 x i8] c"Leaf Nodes are\0A\00"
@.str.4 = [18 x i8] c"Total nodes = %d\0A\00"
@.str.5 = [25 x i8] c"Height of the tree = %d\0A\00"
@.str.6 = [28 x i8] c"in-order traversal of tree\0A\00"
@.str.7 = [27 x i8] c"Number of Full Nodes = %d\0A\00"
@.str.8 = [27 x i8] c"Number of Half Nodes = %d\0A\00"
@.str.9 = [28 x i8] c"Largest Sum of a skew = %d\0A\00"
@.str.10 = [32 x i8] c"Skew Paths from root to leaves\0A\00"
@.str.11 = [18 x i8] c"Sum of tree = %d\0A\00"
@.str.12 = [37 x i8] c"Sum of tree in a different way = %d\0A\00"
define void @main() {
%1 = alloca %struct.node*
%2 = alloca [100 x i32]
%3 = call %struct.node* @createTree(i32 20)
store %struct.node* %3, %struct.node** %1
%4 = load %struct.node*, %struct.node** %1
%5 = call i32 @insert(%struct.node* %4, i32 10)
%6 = load %struct.node*, %struct.node** %1
%7 = call i32 @insert(%struct.node* %6, i32 5)
%8 = load %struct.node*, %struct.node** %1
%9 = call i32 @insert(%struct.node* %8, i32 30)
%10 = load %struct.node*, %struct.node** %1
%11 = call i32 @insert(%struct.node* %10, i32 15)
%12 = load %struct.node*, %struct.node** %1
%13 = call i64 @find(%struct.node* %12, i32 35)
%14 = icmp ne i64 %13, 0
br i1 %14, label %15, label %17
15: ; preds = %0
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str, i64 0, i64 0))
br label %19
17: ; preds = %0
%18 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.1, i64 0, i64 0))
br label %19
19: ; preds = %17, %15
%20 = load %struct.node*, %struct.node** %1
%21 = call i32 @insert(%struct.node* %20, i32 35)
%22 = load %struct.node*, %struct.node** %1
%23 = call i32 @insert(%struct.node* %22, i32 7)
%24 = load %struct.node*, %struct.node** %1
%25 = call i32 @insert(%struct.node* %24, i32 25)
%26 = load %struct.node*, %struct.node** %1
%27 = call i32 @insert(%struct.node* %26, i32 6)
%28 = load %struct.node*, %struct.node** %1
%29 = call i32 @insert(%struct.node* %28, i32 18)
%30 = load %struct.node*, %struct.node** %1
%31 = call i32 @insert(%struct.node* %30, i32 17)
%32 = load %struct.node*, %struct.node** %1
%33 = call i32 @insert(%struct.node* %32, i32 16)
%34 = load %struct.node*, %struct.node** %1
%35 = call i64 @find(%struct.node* %34, i32 35)
%36 = icmp ne i64 %35, 0
br i1 %36, label %37, label %39
37: ; preds = %19
%38 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str, i64 0, i64 0))
br label %41
39: ; preds = %19
%40 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.1, i64 0, i64 0))
br label %41
41: ; preds = %39, %37
%42 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%43 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.3, i64 0, i64 0))
%44 = load %struct.node*, %struct.node** %1
%45 = call i32 @printLeaves(%struct.node* %44)
%46 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%47 = load %struct.node*, %struct.node** %1
%48 = call i32 @totalElements(%struct.node* %47, i32 0)
%49 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.4, i64 0, i64 0), i32 %48)
%50 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%51 = load %struct.node*, %struct.node** %1
%52 = call i32 @heightOfTree(%struct.node* %51, i32 0)
%53 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.5, i64 0, i64 0), i32 %52)
%54 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%55 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.6, i64 0, i64 0))
%56 = load %struct.node*, %struct.node** %1
%57 = call i32 @display(%struct.node* %56)
%58 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.2, i64 0, i64 0))
%59 = load %struct.node*, %struct.node** %1
%60 = call i32 @noOfFullNodes(%struct.node* %59, i32 0)
%61 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.7, i64 0, i64 0), i32 %60)
%62 = load %struct.node*, %struct.node** %1
%63 = call i32 @noOfHalfNodes(%struct.node* %62, i32 0)
%64 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.8, i64 0, i64 0), i32 %63)
%65 = load %struct.node*, %struct.node** %1
%66 = call i32 @largestSum(%struct.node* %65, i32 0)
%67 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.9, i64 0, i64 0), i32 %66)
%68 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([32 x i8], [32 x i8]* @.str.10, i64 0, i64 0))
%69 = load %struct.node*, %struct.node** %1
%70 = getelementptr inbounds [100 x i32], [100 x i32]* %2, i64 0, i64 0
%71 = call i32 @allSkews(%struct.node* %69, i32* %70, i32 0)
%72 = load %struct.node*, %struct.node** %1
%73 = call i32 @sumOfTree(%struct.node* %72, i32 0)
%74 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.11, i64 0, i64 0), i32 %73)
%75 = load %struct.node*, %struct.node** %1
%76 = call i32 @anotherSumOfTree(%struct.node* %75, i32 0)
%77 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.12, i64 0, i64 0), i32 %76)
%78 = load %struct.node*, %struct.node** %1
%79 = call i32 @free(%struct.node* %78)
ret void
}

LLVM IR (-O2):
%struct.node = type { i32 }
@.str.4 = [18 x i8] c"Total nodes = %d\0A\00"
@.str.5 = [25 x i8] c"Height of the tree = %d\0A\00"
@.str.7 = [27 x i8] c"Number of Full Nodes = %d\0A\00"
@.str.8 = [27 x i8] c"Number of Half Nodes = %d\0A\00"
@.str.9 = [28 x i8] c"Largest Sum of a skew = %d\0A\00"
@.str.11 = [18 x i8] c"Sum of tree = %d\0A\00"
@.str.12 = [37 x i8] c"Sum of tree in a different way = %d\0A\00"
@str.13 = [14 x i8] c"ele not found\00"
@str.14 = [15 x i8] c"Leaf Nodes are\00"
@str.15 = [27 x i8] c"in-order traversal of tree\00"
@str.16 = [31 x i8] c"Skew Paths from root to leaves\00"
@str.18 = [10 x i8] c"ele found\00"
define void @main() {
%1 = alloca [100 x i32]
%2 = tail call %struct.node* @createTree(i32 20)
%3 = bitcast [100 x i32]* %1 to i8*
%4 = tail call i32 @insert(%struct.node* %2, i32 10)
%5 = tail call i32 @insert(%struct.node* %2, i32 5)
%6 = tail call i32 @insert(%struct.node* %2, i32 30)
%7 = tail call i32 @insert(%struct.node* %2, i32 15)
%8 = tail call i64 @find(%struct.node* %2, i32 35)
%9 = icmp eq i64 %8, 0
%10 = select i1 %9, i8* getelementptr inbounds ([14 x i8], [14 x i8]* @str.13, i64 0, i64 0), i8* getelementptr inbounds ([10 x i8], [10 x i8]* @str.18, i64 0, i64 0)
%11 = tail call i32 @puts(i8* dereferenceable(1) %10)
%12 = tail call i32 @insert(%struct.node* %2, i32 35)
%13 = tail call i32 @insert(%struct.node* %2, i32 7)
%14 = tail call i32 @insert(%struct.node* %2, i32 25)
%15 = tail call i32 @insert(%struct.node* %2, i32 6)
%16 = tail call i32 @insert(%struct.node* %2, i32 18)
%17 = tail call i32 @insert(%struct.node* %2, i32 17)
%18 = tail call i32 @insert(%struct.node* %2, i32 16)
%19 = tail call i64 @find(%struct.node* %2, i32 35)
%20 = icmp eq i64 %19, 0
%21 = select i1 %20, i8* getelementptr inbounds ([14 x i8], [14 x i8]* @str.13, i64 0, i64 0), i8* getelementptr inbounds ([10 x i8], [10 x i8]* @str.18, i64 0, i64 0)
%22 = tail call i32 @puts(i8* dereferenceable(1) %21)
%23 = tail call i32 @putchar(i32 10)
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.14, i64 0, i64 0))
%25 = tail call i32 @printLeaves(%struct.node* %2)
%26 = tail call i32 @putchar(i32 10)
%27 = tail call i32 @totalElements(%struct.node* %2, i32 0)
%28 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @.str.4, i64 0, i64 0), i32 %27)
%29 = tail call i32 @putchar(i32 10)
%30 = tail call i32 @heightOfTree(%struct.node* %2, i32 0)
%31 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @.str.5, i64 0, i64 0), i32 %30)
%32 = tail call i32 @putchar(i32 10)
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.15, i64 0, i64 0))
%34 = tail call i32 @display(%struct.node* %2)
%35 = tail call i32 @putchar(i32 10)
%36 = tail call i32 @noOfFullNodes(%struct.node* %2, i32 0)
%37 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str.7, i64 0, i64 0), i32 %36)
%38 = tail call i32 @noOfHalfNodes(%struct.node* %2, i32 0)
%39 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str.8, i64 0, i64 0), i32 %38)
%40 = tail call i32 @largestSum(%struct.node* %2, i32 0)
%41 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @.str.9, i64 0, i64 0), i32 %40)
%42 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([31 x i8], [31 x i8]* @str.16, i64 0, i64 0))
%43 = getelementptr inbounds [100 x i32], [100 x i32]* %1, i64 0, i64 0
%44 = call i32 @allSkews(%struct.node* %2, i32* %43, i32 0)
%45 = call i32 @sumOfTree(%struct.node* %2, i32 0)
%46 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @.str.11, i64 0, i64 0), i32 %45)
%47 = call i32 @anotherSumOfTree(%struct.node* %2, i32 0)
%48 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @.str.12, i64 0, i64 0), i32 %47)
%49 = call i32 @free(%struct.node* %2)
ret void
}