	.file	"708506.c"
	.intel_syntax noprefix
	.text
	.section	.rodata
	.align 8
.LC0:
	.string	"Unable to allocate more space for new nodes\n"
	.text
	.globl	newNode
	.type	newNode, @function
newNode:
.LFB6:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	DWORD PTR -28[rbp], esi
	mov	esi, 32
	mov	edi, 1
	call	calloc@PLT
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L2
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 44
	mov	esi, 1
	lea	rdi, .LC0[rip]
	call	fwrite@PLT
	mov	edi, -1
	call	exit@PLT
.L2:
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -28[rbp]
	mov	DWORD PTR [rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -24[rbp]
	mov	QWORD PTR 24[rax], rdx
	mov	rax, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	newNode, .-newNode
	.section	.rodata
	.align 8
.LC1:
	.string	"Tree was empty in findMin call\n"
	.text
	.globl	findMin
	.type	findMin, @function
findMin:
.LFB7:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	cmp	QWORD PTR -24[rbp], 0
	jne	.L5
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 31
	mov	esi, 1
	lea	rdi, .LC1[rip]
	call	fwrite@PLT
	mov	eax, 0
	jmp	.L6
.L5:
	mov	QWORD PTR -8[rbp], 0
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	rdx, rax
	jne	.L7
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L7
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L8
.L7:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
.L8:
	jmp	.L9
.L10:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
.L9:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	jne	.L10
	mov	rax, QWORD PTR -8[rbp]
.L6:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	findMin, .-findMin
	.section	.rodata
.LC2:
	.string	"Tree hasn't been initialized\n"
.LC3:
	.string	"Tree contains no values\n"
	.text
	.globl	Retrieve
	.type	Retrieve, @function
Retrieve:
.LFB8:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	DWORD PTR -28[rbp], esi
	cmp	QWORD PTR -24[rbp], 0
	jne	.L12
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 29
	mov	esi, 1
	lea	rdi, .LC2[rip]
	call	fwrite@PLT
	mov	eax, 0
	jmp	.L13
.L12:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L14
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L15
.L14:
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 24
	mov	esi, 1
	lea	rdi, .LC3[rip]
	call	fwrite@PLT
	mov	eax, 0
	jmp	.L13
.L15:
	mov	QWORD PTR -8[rbp], 0
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	rdx, rax
	jne	.L16
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L16
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L22
.L16:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -8[rbp], rax
.L22:
	cmp	QWORD PTR -8[rbp], 0
	jne	.L18
	mov	eax, 0
	jmp	.L13
.L18:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jge	.L19
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L22
.L19:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jle	.L21
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L22
.L21:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -28[rbp], eax
	jne	.L22
	mov	rax, QWORD PTR -8[rbp]
.L13:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	Retrieve, .-Retrieve
	.section	.rodata
.LC4:
	.string	"the_stack_data/708506.c"
.LC5:
	.string	"Parent != NULL"
	.text
	.globl	Delete_By_Reference
	.type	Delete_By_Reference, @function
Delete_By_Reference:
.LFB9:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 64
	mov	QWORD PTR -56[rbp], rdi
	mov	QWORD PTR -64[rbp], rsi
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L24
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	jne	.L24
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 24[rax]
	mov	QWORD PTR -24[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -64[rbp], rax
	jne	.L25
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR 16[rax], 0
.L25:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 8[rax]
	cmp	QWORD PTR -64[rbp], rax
	jne	.L26
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR 8[rax], 0
.L26:
	mov	rax, QWORD PTR -64[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	eax, 0
	jmp	.L27
.L24:
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	sete	dl
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	sete	al
	xor	eax, edx
	test	al, al
	je	.L28
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 24[rax]
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L29
	lea	rcx, __PRETTY_FUNCTION__.2[rip]
	mov	edx, 127
	lea	rsi, .LC4[rip]
	lea	rdi, .LC5[rip]
	call	__assert_fail@PLT
.L29:
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L30
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -32[rbp], rax
	jmp	.L31
.L30:
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR -32[rbp], rax
.L31:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -64[rbp], rax
	jne	.L32
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -32[rbp]
	mov	QWORD PTR 16[rax], rdx
.L32:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	cmp	QWORD PTR -64[rbp], rax
	jne	.L33
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -32[rbp]
	mov	QWORD PTR 8[rax], rdx
.L33:
	mov	rax, QWORD PTR -32[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 24[rax], rdx
	mov	rax, QWORD PTR -64[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	eax, 0
	jmp	.L27
.L28:
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L34
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L34
	mov	rax, QWORD PTR -64[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	findMin
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR [rax]
	mov	DWORD PTR -36[rbp], eax
	mov	rdx, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR -56[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	Delete_By_Reference
	mov	rax, QWORD PTR -64[rbp]
	mov	edx, DWORD PTR -36[rbp]
	mov	DWORD PTR [rax], edx
	mov	eax, 0
	jmp	.L27
.L34:
	mov	eax, -1
.L27:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE9:
	.size	Delete_By_Reference, .-Delete_By_Reference
	.section	.rodata
.LC6:
	.string	"Didn't find %d in tree\n"
	.text
	.globl	Delete
	.type	Delete, @function
Delete:
.LFB10:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 32
	mov	QWORD PTR -24[rbp], rdi
	mov	DWORD PTR -28[rbp], esi
	mov	edx, DWORD PTR -28[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	esi, edx
	mov	rdi, rax
	call	Retrieve
	mov	QWORD PTR -8[rbp], rax
	cmp	QWORD PTR -8[rbp], 0
	jne	.L36
	mov	rax, QWORD PTR stderr[rip]
	mov	edx, DWORD PTR -28[rbp]
	lea	rsi, .LC6[rip]
	mov	rdi, rax
	mov	eax, 0
	call	fprintf@PLT
	mov	eax, -1
	jmp	.L37
.L36:
	mov	rdx, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR -24[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	Delete_By_Reference
.L37:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE10:
	.size	Delete, .-Delete
	.globl	Free_Recursive
	.type	Free_Recursive, @function
Free_Recursive:
.LFB11:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L39
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	Free_Recursive
.L39:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L40
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	Free_Recursive
.L40:
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	free@PLT
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE11:
	.size	Free_Recursive, .-Free_Recursive
	.globl	Deforestation
	.type	Deforestation, @function
Deforestation:
.LFB12:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	cmp	QWORD PTR -8[rbp], 0
	je	.L44
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L43
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	Free_Recursive
.L43:
	mov	rax, QWORD PTR -8[rbp]
	mov	rdi, rax
	call	free@PLT
.L44:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE12:
	.size	Deforestation, .-Deforestation
	.globl	sortedArrayToBST
	.type	sortedArrayToBST, @function
sortedArrayToBST:
.LFB13:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 80
	mov	QWORD PTR -40[rbp], rdi
	mov	QWORD PTR -48[rbp], rsi
	mov	DWORD PTR -52[rbp], edx
	mov	DWORD PTR -56[rbp], ecx
	mov	QWORD PTR -64[rbp], r8
	mov	DWORD PTR -68[rbp], r9d
	mov	edx, DWORD PTR -52[rbp]
	mov	eax, DWORD PTR -56[rbp]
	add	eax, edx
	mov	edx, eax
	shr	edx, 31
	add	eax, edx
	sar	eax
	mov	DWORD PTR -16[rbp], eax
	mov	eax, DWORD PTR -16[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	add	rax, rdx
	mov	eax, DWORD PTR [rax]
	mov	DWORD PTR -12[rbp], eax
	mov	DWORD PTR -20[rbp], 0
	jmp	.L46
.L49:
	mov	eax, DWORD PTR -20[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -64[rbp]
	add	rax, rdx
	mov	eax, DWORD PTR [rax]
	cmp	DWORD PTR -12[rbp], eax
	jne	.L47
	mov	eax, 0
	jmp	.L48
.L47:
	add	DWORD PTR -20[rbp], 1
.L46:
	mov	eax, DWORD PTR -20[rbp]
	cmp	eax, DWORD PTR -68[rbp]
	jl	.L49
	mov	eax, DWORD PTR -16[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	add	rax, rdx
	mov	edx, DWORD PTR [rax]
	mov	rax, QWORD PTR -40[rbp]
	mov	esi, edx
	mov	rdi, rax
	call	newNode
	mov	QWORD PTR -8[rbp], rax
	mov	eax, DWORD PTR -16[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	add	rax, rdx
	mov	edx, DWORD PTR -68[rbp]
	movsx	rdx, edx
	lea	rcx, 0[0+rdx*4]
	mov	rdx, QWORD PTR -64[rbp]
	add	rdx, rcx
	mov	eax, DWORD PTR [rax]
	mov	DWORD PTR [rdx], eax
	mov	eax, DWORD PTR -52[rbp]
	cmp	eax, DWORD PTR -56[rbp]
	jl	.L50
	mov	rax, QWORD PTR -8[rbp]
	jmp	.L48
.L50:
	mov	eax, DWORD PTR -68[rbp]
	lea	r8d, 1[rax]
	mov	eax, DWORD PTR -16[rbp]
	lea	ecx, -1[rax]
	mov	rdi, QWORD PTR -64[rbp]
	mov	edx, DWORD PTR -52[rbp]
	mov	rsi, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR -8[rbp]
	mov	r9d, r8d
	mov	r8, rdi
	mov	rdi, rax
	call	sortedArrayToBST
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rdx], rax
	mov	eax, DWORD PTR -68[rbp]
	lea	r8d, 1[rax]
	mov	eax, DWORD PTR -16[rbp]
	lea	edi, 1[rax]
	mov	rcx, QWORD PTR -64[rbp]
	mov	edx, DWORD PTR -56[rbp]
	mov	rsi, QWORD PTR -48[rbp]
	mov	rax, QWORD PTR -8[rbp]
	mov	r9d, r8d
	mov	r8, rcx
	mov	ecx, edx
	mov	edx, edi
	mov	rdi, rax
	call	sortedArrayToBST
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rdx], rax
	mov	rax, QWORD PTR -8[rbp]
.L48:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE13:
	.size	sortedArrayToBST, .-sortedArrayToBST
	.section	.rodata
.LC7:
	.string	"%d "
	.text
	.globl	in_Order
	.type	in_Order, @function
in_Order:
.LFB14:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	cmp	QWORD PTR -8[rbp], 0
	je	.L54
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L53
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	in_Order
.L53:
	mov	rax, QWORD PTR -8[rbp]
	mov	eax, DWORD PTR [rax]
	mov	esi, eax
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L54
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	in_Order
.L54:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE14:
	.size	in_Order, .-in_Order
	.globl	In_Order_Non_Recursive
	.type	In_Order_Non_Recursive, @function
In_Order_Non_Recursive:
.LFB15:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	QWORD PTR -8[rbp], rdi
	cmp	QWORD PTR -8[rbp], 0
	jne	.L56
	mov	eax, 0
	jmp	.L57
.L56:
	mov	eax, 0
.L57:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE15:
	.size	In_Order_Non_Recursive, .-In_Order_Non_Recursive
	.globl	min
	.type	min, @function
min:
.LFB16:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	DWORD PTR -4[rbp], edi
	mov	DWORD PTR -8[rbp], esi
	mov	eax, DWORD PTR -4[rbp]
	cmp	eax, DWORD PTR -8[rbp]
	jge	.L59
	mov	eax, DWORD PTR -4[rbp]
	jmp	.L60
.L59:
	mov	eax, DWORD PTR -8[rbp]
.L60:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE16:
	.size	min, .-min
	.globl	max
	.type	max, @function
max:
.LFB17:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	DWORD PTR -4[rbp], edi
	mov	DWORD PTR -8[rbp], esi
	mov	eax, DWORD PTR -4[rbp]
	cmp	eax, DWORD PTR -8[rbp]
	jle	.L62
	mov	eax, DWORD PTR -4[rbp]
	jmp	.L63
.L62:
	mov	eax, DWORD PTR -8[rbp]
.L63:
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE17:
	.size	max, .-max
	.section	.rodata
	.align 8
.LC8:
	.string	"node->value > node->left->value"
	.align 8
.LC9:
	.string	"node->value < node->right->value"
	.text
	.globl	Depth_First_Heap_Assert
	.type	Depth_First_Heap_Assert, @function
Depth_First_Heap_Assert:
.LFB18:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 16
	mov	QWORD PTR -8[rbp], rdi
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L65
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	eax, DWORD PTR [rax]
	cmp	edx, eax
	jg	.L66
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 283
	lea	rsi, .LC4[rip]
	lea	rdi, .LC8[rip]
	call	__assert_fail@PLT
.L66:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	Depth_First_Heap_Assert
.L65:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L69
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR [rax]
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	eax, DWORD PTR [rax]
	cmp	edx, eax
	jl	.L68
	lea	rcx, __PRETTY_FUNCTION__.1[rip]
	mov	edx, 288
	lea	rsi, .LC4[rip]
	lea	rdi, .LC9[rip]
	call	__assert_fail@PLT
.L68:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	Depth_First_Heap_Assert
.L69:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE18:
	.size	Depth_First_Heap_Assert, .-Depth_First_Heap_Assert
	.section	.rodata
	.align 8
.LC10:
	.string	"Unable to allocate space for seen array\n"
	.align 8
.LC11:
	.string	"Unable to allocate space for a new container\n"
.LC12:
	.string	"root->parent == Container[i]"
.LC13:
	.string	"\nPassed assertions"
	.text
	.globl	main
	.type	main, @function
main:
.LFB19:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	push	rbx
	sub	rsp, 72
	.cfi_offset 3, -24
	mov	DWORD PTR -64[rbp], 20000
	mov	eax, DWORD PTR -64[rbp]
	cdqe
	sal	rax, 3
	mov	rdi, rax
	call	malloc@PLT
	mov	QWORD PTR -40[rbp], rax
	mov	DWORD PTR -60[rbp], 9
	mov	eax, DWORD PTR -60[rbp]
	cdqe
	sal	rax, 2
	mov	rdi, rax
	call	malloc@PLT
	mov	QWORD PTR -32[rbp], rax
	cmp	QWORD PTR -32[rbp], 0
	jne	.L71
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 40
	mov	esi, 1
	lea	rdi, .LC10[rip]
	call	fwrite@PLT
	mov	edi, -1
	call	exit@PLT
.L71:
	mov	edi, 2000
	call	malloc@PLT
	mov	QWORD PTR -48[rbp], rax
	mov	DWORD PTR -80[rbp], 0
	jmp	.L72
.L80:
	mov	eax, DWORD PTR -80[rbp]
	imul	eax, eax, 500
	mov	DWORD PTR -56[rbp], eax
	mov	eax, 10000000
	sub	eax, DWORD PTR -56[rbp]
	mov	esi, eax
	mov	edi, 500
	call	min
	mov	DWORD PTR -52[rbp], eax
	cmp	DWORD PTR -52[rbp], 499
	jg	.L73
	mov	eax, DWORD PTR -52[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	mov	rsi, rdx
	mov	rdi, rax
	call	realloc@PLT
	mov	QWORD PTR -48[rbp], rax
.L73:
	mov	DWORD PTR -76[rbp], 0
	jmp	.L74
.L75:
	mov	eax, DWORD PTR -76[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	add	rax, rdx
	mov	ecx, DWORD PTR -76[rbp]
	mov	edx, DWORD PTR -56[rbp]
	add	edx, ecx
	mov	DWORD PTR [rax], edx
	add	DWORD PTR -76[rbp], 1
.L74:
	mov	eax, DWORD PTR -76[rbp]
	cmp	eax, DWORD PTR -52[rbp]
	jl	.L75
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	lea	rbx, [rdx+rax]
	mov	edi, 32
	call	malloc@PLT
	mov	QWORD PTR [rbx], rax
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rdx
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L76
	mov	rax, QWORD PTR stderr[rip]
	mov	rcx, rax
	mov	edx, 45
	mov	esi, 1
	lea	rdi, .LC11[rip]
	call	fwrite@PLT
	mov	edi, -1
	call	exit@PLT
.L76:
	mov	eax, DWORD PTR -52[rbp]
	lea	edx, -1[rax]
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rcx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rcx
	mov	rax, QWORD PTR [rax]
	mov	rcx, QWORD PTR -32[rbp]
	mov	rsi, QWORD PTR -48[rbp]
	mov	r9d, 0
	mov	r8, rcx
	mov	ecx, edx
	mov	edx, 0
	mov	rdi, rax
	call	sortedArrayToBST
	mov	QWORD PTR -24[rbp], rax
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rdx
	mov	rax, QWORD PTR [rax]
	mov	rdx, QWORD PTR -24[rbp]
	mov	QWORD PTR 16[rax], rdx
	mov	edx, DWORD PTR -80[rbp]
	movsx	rdx, edx
	lea	rcx, 0[0+rdx*8]
	mov	rdx, QWORD PTR -40[rbp]
	add	rdx, rcx
	mov	rdx, QWORD PTR [rdx]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR 8[rdx], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR 24[rax]
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rcx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rcx
	mov	rax, QWORD PTR [rax]
	cmp	rdx, rax
	je	.L77
	lea	rcx, __PRETTY_FUNCTION__.0[rip]
	mov	edx, 337
	lea	rsi, .LC4[rip]
	lea	rdi, .LC12[rip]
	call	__assert_fail@PLT
.L77:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	Depth_First_Heap_Assert
	mov	DWORD PTR -72[rbp], 0
	jmp	.L78
.L79:
	mov	eax, DWORD PTR -72[rbp]
	cdqe
	lea	rdx, 0[0+rax*4]
	mov	rax, QWORD PTR -48[rbp]
	add	rax, rdx
	mov	edx, DWORD PTR [rax]
	mov	eax, DWORD PTR -80[rbp]
	cdqe
	lea	rcx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rcx
	mov	rax, QWORD PTR [rax]
	mov	esi, edx
	mov	rdi, rax
	call	Delete
	add	DWORD PTR -72[rbp], 1
.L78:
	mov	eax, DWORD PTR -72[rbp]
	cmp	eax, DWORD PTR -52[rbp]
	jl	.L79
	add	DWORD PTR -80[rbp], 1
.L72:
	mov	eax, DWORD PTR -80[rbp]
	cmp	eax, DWORD PTR -64[rbp]
	jl	.L80
	mov	rax, QWORD PTR -48[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	rax, QWORD PTR -32[rbp]
	mov	rdi, rax
	call	free@PLT
	mov	DWORD PTR -68[rbp], 0
	jmp	.L81
.L82:
	mov	eax, DWORD PTR -68[rbp]
	cdqe
	lea	rdx, 0[0+rax*8]
	mov	rax, QWORD PTR -40[rbp]
	add	rax, rdx
	mov	rax, QWORD PTR [rax]
	mov	rdi, rax
	call	Deforestation
	add	DWORD PTR -68[rbp], 1
.L81:
	mov	eax, DWORD PTR -68[rbp]
	cmp	eax, DWORD PTR -64[rbp]
	jl	.L82
	lea	rdi, .LC13[rip]
	call	puts@PLT
	mov	eax, 0
	mov	rbx, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE19:
	.size	main, .-main
	.section	.rodata
	.align 16
	.type	__PRETTY_FUNCTION__.2, @object
	.size	__PRETTY_FUNCTION__.2, 20
__PRETTY_FUNCTION__.2:
	.string	"Delete_By_Reference"
	.align 16
	.type	__PRETTY_FUNCTION__.1, @object
	.size	__PRETTY_FUNCTION__.1, 24
__PRETTY_FUNCTION__.1:
	.string	"Depth_First_Heap_Assert"
	.type	__PRETTY_FUNCTION__.0, @object
	.size	__PRETTY_FUNCTION__.0, 5
__PRETTY_FUNCTION__.0:
	.string	"main"
	.ident	"GCC: (Ubuntu 10.5.0-1ubuntu1~20.04) 10.5.0"
	.section	.note.GNU-stack,"",@progbits
	.section	.note.gnu.property,"a"
	.align 8
	.long	 1f - 0f
	.long	 4f - 1f
	.long	 5
0:
	.string	 "GNU"
1:
	.align 8
	.long	 0xc0000002
	.long	 3f - 2f
2:
	.long	 0x3
3:
	.align 8
4:

	.arch armv5t
	.eabi_attribute 20, 1
	.eabi_attribute 21, 1
	.eabi_attribute 23, 3
	.eabi_attribute 24, 1
	.eabi_attribute 25, 1
	.eabi_attribute 26, 2
	.eabi_attribute 30, 6
	.eabi_attribute 34, 0
	.eabi_attribute 18, 4
	.file	"708506.c"
	.text
	.section	.rodata
	.align	2
.LC0:
	.ascii	"Unable to allocate more space for new nodes\012\000"
	.text
	.align	2
	.global	newNode
	.syntax unified
	.arm
	.fpu softvfp
	.type	newNode, %function
newNode:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	mov	r1, #16
	mov	r0, #1
	bl	calloc
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L2
	ldr	r3, .L4
	ldr	r3, [r3]
	mov	r2, #44
	mov	r1, #1
	ldr	r0, .L4+4
	bl	fwrite
	mvn	r0, #0
	bl	exit
.L2:
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-20]
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-16]
	str	r2, [r3, #12]
	ldr	r3, [fp, #-8]
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L5:
	.align	2
.L4:
	.word	stderr
	.word	.LC0
	.size	newNode, .-newNode
	.section	.rodata
	.align	2
.LC1:
	.ascii	"Tree was empty in findMin call\012\000"
	.text
	.align	2
	.global	findMin
	.syntax unified
	.arm
	.fpu softvfp
	.type	findMin, %function
findMin:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L7
	ldr	r3, .L13
	ldr	r3, [r3]
	mov	r2, #31
	mov	r1, #1
	ldr	r0, .L13+4
	bl	fwrite
	mov	r3, #0
	b	.L8
.L7:
	mov	r3, #0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r2, r3
	bne	.L9
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L9
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
	b	.L10
.L9:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
.L10:
	b	.L11
.L12:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
.L11:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	bne	.L12
	ldr	r3, [fp, #-8]
.L8:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L14:
	.align	2
.L13:
	.word	stderr
	.word	.LC1
	.size	findMin, .-findMin
	.section	.rodata
	.align	2
.LC2:
	.ascii	"Tree hasn't been initialized\012\000"
	.align	2
.LC3:
	.ascii	"Tree contains no values\012\000"
	.text
	.align	2
	.global	Retrieve
	.syntax unified
	.arm
	.fpu softvfp
	.type	Retrieve, %function
Retrieve:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L16
	ldr	r3, .L27
	ldr	r3, [r3]
	mov	r2, #29
	mov	r1, #1
	ldr	r0, .L27+4
	bl	fwrite
	mov	r3, #0
	b	.L17
.L16:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L18
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L19
.L18:
	ldr	r3, .L27
	ldr	r3, [r3]
	mov	r2, #24
	mov	r1, #1
	ldr	r0, .L27+8
	bl	fwrite
	mov	r3, #0
	b	.L17
.L19:
	mov	r3, #0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r2, r3
	bne	.L20
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L20
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
	b	.L26
.L20:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-8]
.L26:
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L22
	mov	r3, #0
	b	.L17
.L22:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	bge	.L23
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-8]
	b	.L26
.L23:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	ble	.L25
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
	b	.L26
.L25:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	cmp	r2, r3
	bne	.L26
	ldr	r3, [fp, #-8]
.L17:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L28:
	.align	2
.L27:
	.word	stderr
	.word	.LC2
	.word	.LC3
	.size	Retrieve, .-Retrieve
	.section	.rodata
	.align	2
.LC4:
	.ascii	"the_stack_data/708506.c\000"
	.align	2
.LC5:
	.ascii	"Parent != NULL\000"
	.text
	.align	2
	.global	Delete_By_Reference
	.syntax unified
	.arm
	.fpu softvfp
	.type	Delete_By_Reference, %function
Delete_By_Reference:
	@ args = 0, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #32
	str	r0, [fp, #-32]
	str	r1, [fp, #-36]
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L30
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	bne	.L30
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #12]
	str	r3, [fp, #-20]
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-36]
	cmp	r2, r3
	bne	.L31
	ldr	r3, [fp, #-20]
	mov	r2, #0
	str	r2, [r3, #8]
.L31:
	ldr	r3, [fp, #-20]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-36]
	cmp	r2, r3
	bne	.L32
	ldr	r3, [fp, #-20]
	mov	r2, #0
	str	r2, [r3, #4]
.L32:
	ldr	r0, [fp, #-36]
	bl	free
	mov	r3, #0
	b	.L33
.L30:
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	moveq	r3, #1
	movne	r3, #0
	and	r2, r3, #255
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	moveq	r3, #1
	movne	r3, #0
	and	r3, r3, #255
	eor	r3, r3, r2
	and	r3, r3, #255
	cmp	r3, #0
	beq	.L34
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #12]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L35
	ldr	r3, .L41
	mov	r2, #127
	ldr	r1, .L41+4
	ldr	r0, .L41+8
	bl	__assert_fail
.L35:
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L36
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-24]
	b	.L37
.L36:
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #4]
	str	r3, [fp, #-24]
.L37:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-36]
	cmp	r2, r3
	bne	.L38
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-24]
	str	r2, [r3, #8]
.L38:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-36]
	cmp	r2, r3
	bne	.L39
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-24]
	str	r2, [r3, #4]
.L39:
	ldr	r3, [fp, #-24]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #12]
	ldr	r0, [fp, #-36]
	bl	free
	mov	r3, #0
	b	.L33
.L34:
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L40
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L40
	ldr	r3, [fp, #-36]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	findMin
	str	r0, [fp, #-16]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	ldr	r1, [fp, #-16]
	ldr	r0, [fp, #-32]
	bl	Delete_By_Reference
	ldr	r3, [fp, #-36]
	ldr	r2, [fp, #-12]
	str	r2, [r3]
	mov	r3, #0
	b	.L33
.L40:
	mvn	r3, #0
.L33:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L42:
	.align	2
.L41:
	.word	__PRETTY_FUNCTION__.6197
	.word	.LC4
	.word	.LC5
	.size	Delete_By_Reference, .-Delete_By_Reference
	.section	.rodata
	.align	2
.LC6:
	.ascii	"Didn't find %d in tree\012\000"
	.text
	.align	2
	.global	Delete
	.syntax unified
	.arm
	.fpu softvfp
	.type	Delete, %function
Delete:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	str	r0, [fp, #-16]
	str	r1, [fp, #-20]
	ldr	r1, [fp, #-20]
	ldr	r0, [fp, #-16]
	bl	Retrieve
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L44
	ldr	r3, .L46
	ldr	r3, [r3]
	ldr	r2, [fp, #-20]
	ldr	r1, .L46+4
	mov	r0, r3
	bl	fprintf
	mvn	r3, #0
	b	.L45
.L44:
	ldr	r1, [fp, #-8]
	ldr	r0, [fp, #-16]
	bl	Delete_By_Reference
	mov	r3, r0
.L45:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L47:
	.align	2
.L46:
	.word	stderr
	.word	.LC6
	.size	Delete, .-Delete
	.align	2
	.global	Free_Recursive
	.syntax unified
	.arm
	.fpu softvfp
	.type	Free_Recursive, %function
Free_Recursive:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L49
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	Free_Recursive
.L49:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L50
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	Free_Recursive
.L50:
	ldr	r0, [fp, #-8]
	bl	free
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	Free_Recursive, .-Free_Recursive
	.align	2
	.global	Deforestation
	.syntax unified
	.arm
	.fpu softvfp
	.type	Deforestation, %function
Deforestation:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	beq	.L54
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L53
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	Free_Recursive
.L53:
	ldr	r0, [fp, #-8]
	bl	free
.L54:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	Deforestation, .-Deforestation
	.align	2
	.global	sortedArrayToBST
	.syntax unified
	.arm
	.fpu softvfp
	.type	sortedArrayToBST, %function
sortedArrayToBST:
	@ args = 8, pretend = 0, frame = 32
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #40
	str	r0, [fp, #-24]
	str	r1, [fp, #-28]
	str	r2, [fp, #-32]
	str	r3, [fp, #-36]
	ldr	r2, [fp, #-32]
	ldr	r3, [fp, #-36]
	add	r3, r2, r3
	lsr	r2, r3, #31
	add	r3, r2, r3
	asr	r3, r3, #1
	str	r3, [fp, #-16]
	ldr	r3, [fp, #-16]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-28]
	add	r3, r2, r3
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	mov	r3, #0
	str	r3, [fp, #-20]
	b	.L56
.L59:
	ldr	r3, [fp, #-20]
	lsl	r3, r3, #2
	ldr	r2, [fp, #4]
	add	r3, r2, r3
	ldr	r3, [r3]
	ldr	r2, [fp, #-12]
	cmp	r2, r3
	bne	.L57
	mov	r3, #0
	b	.L58
.L57:
	ldr	r3, [fp, #-20]
	add	r3, r3, #1
	str	r3, [fp, #-20]
.L56:
	ldr	r2, [fp, #-20]
	ldr	r3, [fp, #8]
	cmp	r2, r3
	blt	.L59
	ldr	r3, [fp, #-16]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-28]
	add	r3, r2, r3
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, [fp, #-24]
	bl	newNode
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-16]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-28]
	add	r2, r2, r3
	ldr	r3, [fp, #8]
	lsl	r3, r3, #2
	ldr	r1, [fp, #4]
	add	r3, r1, r3
	ldr	r2, [r2]
	str	r2, [r3]
	ldr	r2, [fp, #-32]
	ldr	r3, [fp, #-36]
	cmp	r2, r3
	blt	.L60
	ldr	r3, [fp, #-8]
	b	.L58
.L60:
	ldr	r3, [fp, #-16]
	sub	r2, r3, #1
	ldr	r3, [fp, #8]
	add	r3, r3, #1
	str	r3, [sp, #4]
	ldr	r3, [fp, #4]
	str	r3, [sp]
	mov	r3, r2
	ldr	r2, [fp, #-32]
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-8]
	bl	sortedArrayToBST
	mov	r2, r0
	ldr	r3, [fp, #-8]
	str	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	add	r2, r3, #1
	ldr	r3, [fp, #8]
	add	r3, r3, #1
	str	r3, [sp, #4]
	ldr	r3, [fp, #4]
	str	r3, [sp]
	ldr	r3, [fp, #-36]
	ldr	r1, [fp, #-28]
	ldr	r0, [fp, #-8]
	bl	sortedArrayToBST
	mov	r2, r0
	ldr	r3, [fp, #-8]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
.L58:
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	sortedArrayToBST, .-sortedArrayToBST
	.section	.rodata
	.align	2
.LC7:
	.ascii	"%d \000"
	.text
	.align	2
	.global	in_Order
	.syntax unified
	.arm
	.fpu softvfp
	.type	in_Order, %function
in_Order:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	beq	.L64
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L63
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	in_Order
.L63:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, .L65
	bl	printf
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L64
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	in_Order
.L64:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L66:
	.align	2
.L65:
	.word	.LC7
	.size	in_Order, .-in_Order
	.align	2
	.global	In_Order_Non_Recursive
	.syntax unified
	.arm
	.fpu softvfp
	.type	In_Order_Non_Recursive, %function
In_Order_Non_Recursive:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	cmp	r3, #0
	bne	.L68
	mov	r3, #0
	b	.L69
.L68:
	mov	r3, #0
.L69:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	In_Order_Non_Recursive, .-In_Order_Non_Recursive
	.align	2
	.global	min
	.syntax unified
	.arm
	.fpu softvfp
	.type	min, %function
min:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	ldr	r2, [fp, #-8]
	ldr	r3, [fp, #-12]
	cmp	r2, r3
	bge	.L71
	ldr	r3, [fp, #-8]
	b	.L72
.L71:
	ldr	r3, [fp, #-12]
.L72:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	min, .-min
	.align	2
	.global	max
	.syntax unified
	.arm
	.fpu softvfp
	.type	max, %function
max:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	@ link register save eliminated.
	str	fp, [sp, #-4]!
	add	fp, sp, #0
	sub	sp, sp, #12
	str	r0, [fp, #-8]
	str	r1, [fp, #-12]
	ldr	r2, [fp, #-8]
	ldr	r3, [fp, #-12]
	cmp	r2, r3
	ble	.L74
	ldr	r3, [fp, #-8]
	b	.L75
.L74:
	ldr	r3, [fp, #-12]
.L75:
	mov	r0, r3
	add	sp, fp, #0
	@ sp needed
	ldr	fp, [sp], #4
	bx	lr
	.size	max, .-max
	.section	.rodata
	.align	2
.LC8:
	.ascii	"node->value > node->left->value\000"
	.align	2
.LC9:
	.ascii	"node->value < node->right->value\000"
	.text
	.align	2
	.global	Depth_First_Heap_Assert
	.syntax unified
	.arm
	.fpu softvfp
	.type	Depth_First_Heap_Assert, %function
Depth_First_Heap_Assert:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	str	r0, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L77
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	ldr	r3, [r3]
	cmp	r2, r3
	bgt	.L78
	ldr	r3, .L82
	ldr	r2, .L82+4
	ldr	r1, .L82+8
	ldr	r0, .L82+12
	bl	__assert_fail
.L78:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	Depth_First_Heap_Assert
.L77:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L81
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r3, [r3]
	cmp	r2, r3
	blt	.L80
	ldr	r3, .L82
	mov	r2, #288
	ldr	r1, .L82+8
	ldr	r0, .L82+16
	bl	__assert_fail
.L80:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	Depth_First_Heap_Assert
.L81:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L83:
	.align	2
.L82:
	.word	__PRETTY_FUNCTION__.6243
	.word	283
	.word	.LC4
	.word	.LC8
	.word	.LC9
	.size	Depth_First_Heap_Assert, .-Depth_First_Heap_Assert
	.section	.rodata
	.align	2
.LC10:
	.ascii	"Unable to allocate space for seen array\012\000"
	.align	2
.LC11:
	.ascii	"Unable to allocate space for a new container\012\000"
	.align	2
.LC12:
	.ascii	"root->parent == Container[i]\000"
	.align	2
.LC13:
	.ascii	"\012Passed assertions\000"
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ args = 0, pretend = 0, frame = 48
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{r4, fp, lr}
	add	fp, sp, #8
	sub	sp, sp, #60
	ldr	r3, .L98
	str	r3, [fp, #-40]
	ldr	r3, [fp, #-40]
	lsl	r3, r3, #2
	mov	r0, r3
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-36]
	mov	r3, #9
	str	r3, [fp, #-32]
	ldr	r3, [fp, #-32]
	lsl	r3, r3, #2
	mov	r0, r3
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-28]
	ldr	r3, [fp, #-28]
	cmp	r3, #0
	bne	.L85
	ldr	r3, .L98+4
	ldr	r3, [r3]
	mov	r2, #40
	mov	r1, #1
	ldr	r0, .L98+8
	bl	fwrite
	mvn	r0, #0
	bl	exit
.L85:
	mov	r0, #2000
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-60]
	mov	r3, #0
	str	r3, [fp, #-56]
	b	.L86
.L94:
	ldr	r2, [fp, #-56]
	mov	r3, r2
	lsl	r3, r3, #5
	sub	r3, r3, r2
	lsl	r3, r3, #2
	add	r3, r3, r2
	lsl	r3, r3, #2
	str	r3, [fp, #-24]
	ldr	r2, [fp, #-24]
	ldr	r3, .L98+12
	sub	r3, r3, r2
	mov	r1, r3
	mov	r0, #500
	bl	min
	str	r0, [fp, #-20]
	ldr	r3, [fp, #-20]
	cmp	r3, #500
	bge	.L87
	ldr	r3, [fp, #-20]
	lsl	r3, r3, #2
	mov	r1, r3
	ldr	r0, [fp, #-60]
	bl	realloc
	str	r0, [fp, #-60]
.L87:
	mov	r3, #0
	str	r3, [fp, #-52]
	b	.L88
.L89:
	ldr	r3, [fp, #-52]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-60]
	add	r3, r2, r3
	ldr	r1, [fp, #-52]
	ldr	r2, [fp, #-24]
	add	r2, r1, r2
	str	r2, [r3]
	ldr	r3, [fp, #-52]
	add	r3, r3, #1
	str	r3, [fp, #-52]
.L88:
	ldr	r2, [fp, #-52]
	ldr	r3, [fp, #-20]
	cmp	r2, r3
	blt	.L89
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r4, r2, r3
	mov	r0, #16
	bl	malloc
	mov	r3, r0
	str	r3, [r4]
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r3, r2, r3
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L90
	ldr	r3, .L98+4
	ldr	r3, [r3]
	mov	r2, #45
	mov	r1, #1
	ldr	r0, .L98+16
	bl	fwrite
	mvn	r0, #0
	bl	exit
.L90:
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r3, r2, r3
	ldr	r0, [r3]
	ldr	r3, [fp, #-20]
	sub	r2, r3, #1
	mov	r3, #0
	str	r3, [sp, #4]
	ldr	r3, [fp, #-28]
	str	r3, [sp]
	mov	r3, r2
	mov	r2, #0
	ldr	r1, [fp, #-60]
	bl	sortedArrayToBST
	str	r0, [fp, #-16]
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r3, r2, r3
	ldr	r3, [r3]
	ldr	r2, [fp, #-16]
	str	r2, [r3, #8]
	ldr	r2, [fp, #-56]
	lsl	r2, r2, #2
	ldr	r1, [fp, #-36]
	add	r2, r1, r2
	ldr	r2, [r2]
	ldr	r3, [r3, #8]
	str	r3, [r2, #4]
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #12]
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r1, [fp, #-36]
	add	r3, r1, r3
	ldr	r3, [r3]
	cmp	r2, r3
	beq	.L91
	ldr	r3, .L98+20
	ldr	r2, .L98+24
	ldr	r1, .L98+28
	ldr	r0, .L98+32
	bl	__assert_fail
.L91:
	ldr	r0, [fp, #-16]
	bl	Depth_First_Heap_Assert
	mov	r3, #0
	str	r3, [fp, #-48]
	b	.L92
.L93:
	ldr	r3, [fp, #-56]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r3, r2, r3
	ldr	r0, [r3]
	ldr	r3, [fp, #-48]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-60]
	add	r3, r2, r3
	ldr	r3, [r3]
	mov	r1, r3
	bl	Delete
	ldr	r3, [fp, #-48]
	add	r3, r3, #1
	str	r3, [fp, #-48]
.L92:
	ldr	r2, [fp, #-48]
	ldr	r3, [fp, #-20]
	cmp	r2, r3
	blt	.L93
	ldr	r3, [fp, #-56]
	add	r3, r3, #1
	str	r3, [fp, #-56]
.L86:
	ldr	r2, [fp, #-56]
	ldr	r3, [fp, #-40]
	cmp	r2, r3
	blt	.L94
	ldr	r0, [fp, #-60]
	bl	free
	ldr	r0, [fp, #-28]
	bl	free
	mov	r3, #0
	str	r3, [fp, #-44]
	b	.L95
.L96:
	ldr	r3, [fp, #-44]
	lsl	r3, r3, #2
	ldr	r2, [fp, #-36]
	add	r3, r2, r3
	ldr	r3, [r3]
	mov	r0, r3
	bl	Deforestation
	ldr	r3, [fp, #-44]
	add	r3, r3, #1
	str	r3, [fp, #-44]
.L95:
	ldr	r2, [fp, #-44]
	ldr	r3, [fp, #-40]
	cmp	r2, r3
	blt	.L96
	ldr	r0, .L98+36
	bl	puts
	mov	r3, #0
	mov	r0, r3
	sub	sp, fp, #8
	@ sp needed
	pop	{r4, fp, pc}
.L99:
	.align	2
.L98:
	.word	20000
	.word	stderr
	.word	.LC10
	.word	10000000
	.word	.LC11
	.word	__PRETTY_FUNCTION__.6259
	.word	337
	.word	.LC4
	.word	.LC12
	.word	.LC13
	.size	main, .-main
	.section	.rodata
	.align	2
	.type	__PRETTY_FUNCTION__.6197, %object
	.size	__PRETTY_FUNCTION__.6197, 20
__PRETTY_FUNCTION__.6197:
	.ascii	"Delete_By_Reference\000"
	.align	2
	.type	__PRETTY_FUNCTION__.6243, %object
	.size	__PRETTY_FUNCTION__.6243, 24
__PRETTY_FUNCTION__.6243:
	.ascii	"Depth_First_Heap_Assert\000"
	.align	2
	.type	__PRETTY_FUNCTION__.6259, %object
	.size	__PRETTY_FUNCTION__.6259, 5
__PRETTY_FUNCTION__.6259:
	.ascii	"main\000"
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
