	.file	"51648.c"
	.intel_syntax noprefix
	.text
	.globl	root
	.bss
	.align 8
	.type	root, @object
	.size	root, 8
root:
	.zero	8
	.globl	s1
	.align 32
	.type	s1, @object
	.size	s1, 800
s1:
	.zero	800
	.globl	top
	.data
	.align 4
	.type	top, @object
	.size	top, 4
top:
	.long	-1
	.globl	dtop
	.bss
	.align 8
	.type	dtop, @object
	.size	dtop, 8
dtop:
	.zero	8
	.section	.rodata
.LC0:
	.string	"\nOut of Memory Space:"
.LC1:
	.string	" This Value %d Has Inserted\n"
	.text
	.globl	dpush
	.type	dpush, @function
dpush:
.LFB0:
	.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	edi, 16
	call	malloc@PLT
	mov	QWORD PTR -16[rbp], rax
	cmp	QWORD PTR -16[rbp], 0
	jne	.L2
	lea	rdi, .LC0[rip]
	call	puts@PLT
	mov	edi, 0
	call	exit@PLT
.L2:
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR 8[rax]
	mov	esi, eax
	lea	rdi, .LC1[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -24[rbp]
	mov	edx, DWORD PTR 8[rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	DWORD PTR [rax], edx
	mov	rdx, QWORD PTR dtop[rip]
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR 8[rax], rdx
	mov	rax, QWORD PTR dtop[rip]
	test	rax, rax
	jne	.L3
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR dtop[rip], rax
	jmp	.L5
.L3:
	mov	eax, DWORD PTR top[rip]
	cdqe
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR dtop[rip], rax
	mov	rax, QWORD PTR dtop[rip]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rax], rdx
.L5:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE0:
	.size	dpush, .-dpush
	.section	.rodata
	.align 8
.LC2:
	.string	"\n  The Stack Is Under Flow Or Empty : \t "
	.align 8
.LC3:
	.string	"\n This Node Or Element %d Has Been Popped From The Stack : \t \n"
	.text
	.globl	dpop
	.type	dpop, @function
dpop:
.LFB1:
	.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	rax, QWORD PTR dtop[rip]
	test	rax, rax
	jne	.L7
	lea	rdi, .LC2[rip]
	call	puts@PLT
	jmp	.L9
.L7:
	mov	rax, QWORD PTR dtop[rip]
	mov	eax, DWORD PTR [rax]
	mov	esi, eax
	lea	rdi, .LC3[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR dtop[rip]
	mov	rax, QWORD PTR 8[rax]
	mov	QWORD PTR dtop[rip], rax
.L9:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE1:
	.size	dpop, .-dpop
	.section	.rodata
	.align 8
.LC4:
	.string	"\n Operations Of Binary Search Tree"
.LC5:
	.string	"\n Give Your Choice"
	.align 8
.LC6:
	.string	"\n 1. Insert \n 2. Delete A Specific Node Or Element \n 3. Display Nodes With In-Order Traversal \n 4. Search A Node \n 5. Stack Version Pre-Order \n 6. Pre-Order Display With Dynamic Stack \n 7. Exit "
.LC7:
	.string	"%d"
.LC8:
	.string	"\n Give The Element"
.LC9:
	.string	"Give Node Data To Be Searched"
.LC10:
	.string	"\n Stack Version Pre Order "
	.align 8
.LC11:
	.string	"\n This Is The Dynamic Stack Version "
	.align 8
.LC12:
	.string	"\n Okay Exiting Now Bye.....-->+_+<--"
	.text
	.globl	main
	.type	main, @function
main:
.LFB2:
	.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	rax, QWORD PTR fs:40
	mov	QWORD PTR -8[rbp], rax
	xor	eax, eax
.L20:
	lea	rdi, .LC4[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rdi, .LC5[rip]
	mov	eax, 0
	call	printf@PLT
	lea	rdi, .LC6[rip]
	call	puts@PLT
	lea	rax, -16[rbp]
	mov	rsi, rax
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	eax, DWORD PTR -16[rbp]
	cmp	eax, 7
	ja	.L20
	mov	eax, eax
	lea	rdx, 0[0+rax*4]
	lea	rax, .L13[rip]
	mov	eax, DWORD PTR [rdx+rax]
	cdqe
	lea	rdx, .L13[rip]
	add	rax, rdx
	notrack jmp	rax
	.section	.rodata
	.align 4
	.align 4
.L13:
	.long	.L20-.L13
	.long	.L19-.L13
	.long	.L18-.L13
	.long	.L17-.L13
	.long	.L16-.L13
	.long	.L15-.L13
	.long	.L14-.L13
	.long	.L12-.L13
	.text
.L19:
	mov	eax, 0
	call	insertintree
	jmp	.L11
.L18:
	lea	rdi, .LC8[rip]
	call	puts@PLT
	lea	rax, -12[rbp]
	mov	rsi, rax
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	eax, DWORD PTR -12[rbp]
	mov	edi, eax
	mov	eax, 0
	call	deletefromtree
	jmp	.L11
.L17:
	mov	eax, 0
	call	displayinorder
	jmp	.L11
.L16:
	lea	rdi, .LC9[rip]
	call	puts@PLT
	lea	rax, -12[rbp]
	mov	rsi, rax
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	eax, DWORD PTR -12[rbp]
	mov	edi, eax
	call	searcht
	jmp	.L11
.L15:
	lea	rdi, .LC10[rip]
	call	puts@PLT
	mov	eax, 0
	call	stackpre
	jmp	.L11
.L14:
	lea	rdi, .LC11[rip]
	call	puts@PLT
	mov	eax, 0
	call	dpreorder
	jmp	.L11
.L12:
	lea	rdi, .LC12[rip]
	call	puts@PLT
	mov	edi, 0
	call	exit@PLT
.L11:
	jmp	.L20
	.cfi_endproc
.LFE2:
	.size	main, .-main
	.section	.rodata
.LC13:
	.string	"\nGive Integer Data \n"
	.text
	.globl	insertintree
	.type	insertintree, @function
insertintree:
.LFB3:
	.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	rax, QWORD PTR root[rip]
	mov	QWORD PTR -24[rbp], rax
	mov	edi, 24
	call	malloc@PLT
	mov	QWORD PTR -8[rbp], rax
	lea	rdi, .LC13[rip]
	call	puts@PLT
	mov	rax, QWORD PTR -8[rbp]
	add	rax, 8
	mov	rsi, rax
	lea	rdi, .LC7[rip]
	mov	eax, 0
	call	__isoc99_scanf@PLT
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
	mov	rax, QWORD PTR root[rip]
	test	rax, rax
	jne	.L25
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR root[rip], rax
	jmp	.L29
.L27:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	edx, eax
	jle	.L26
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -24[rbp], rax
	jmp	.L25
.L26:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -24[rbp], rax
.L25:
	cmp	QWORD PTR -24[rbp], 0
	jne	.L27
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR 8[rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	edx, eax
	jge	.L28
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L29
.L28:
	mov	rax, QWORD PTR -16[rbp]
	mov	rdx, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], rdx
.L29:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE3:
	.size	insertintree, .-insertintree
	.section	.rodata
	.align 8
.LC14:
	.string	"The Tree Does Not Have Any Nodes Yet !!!"
.LC15:
	.string	"hello"
	.align 8
.LC16:
	.string	"\n Now The Smallest Element From Right Sub Tree Is Root !!! \n"
	.text
	.globl	deletefromtree
	.type	deletefromtree, @function
deletefromtree:
.LFB4:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	sub	rsp, 48
	mov	DWORD PTR -36[rbp], edi
	mov	rax, QWORD PTR root[rip]
	mov	QWORD PTR -24[rbp], rax
	mov	QWORD PTR -16[rbp], 0
	cmp	QWORD PTR -24[rbp], 0
	jne	.L33
	lea	rdi, .LC14[rip]
	call	puts@PLT
	jmp	.L30
.L37:
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	DWORD PTR -36[rbp], eax
	je	.L55
	mov	rax, QWORD PTR -24[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	DWORD PTR -36[rbp], eax
	jge	.L36
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -24[rbp], rax
	jmp	.L33
.L36:
	mov	rax, QWORD PTR -24[rbp]
	mov	QWORD PTR -16[rbp], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -24[rbp], rax
.L33:
	cmp	QWORD PTR -24[rbp], 0
	jne	.L37
	jmp	.L35
.L55:
	nop
.L35:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L38
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L38
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -24[rbp], rax
	jne	.L39
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR 16[rax], 0
	jmp	.L30
.L39:
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR [rax], 0
	jmp	.L30
.L38:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	je	.L41
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	jne	.L41
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -24[rbp], rax
	jne	.L42
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR 16[rax], rdx
	jmp	.L30
.L42:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L30
.L41:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L44
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L44
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -24[rbp], rax
	jne	.L45
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR 16[rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR 16[rax], rdx
	jmp	.L30
.L45:
	mov	rax, QWORD PTR -24[rbp]
	mov	rdx, QWORD PTR 16[rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR [rax], rdx
	jmp	.L30
.L44:
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	je	.L30
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L30
	mov	rax, QWORD PTR -24[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR root[rip]
	cmp	QWORD PTR -24[rbp], rax
	jne	.L47
	jmp	.L48
.L49:
	lea	rdi, .LC15[rip]
	call	puts@PLT
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
.L48:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L49
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	edx, DWORD PTR 8[rax]
	mov	rax, QWORD PTR -24[rbp]
	mov	DWORD PTR 8[rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
	lea	rdi, .LC16[rip]
	call	puts@PLT
	jmp	.L30
.L47:
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -24[rbp], rax
	jne	.L53
	jmp	.L51
.L52:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
.L51:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L52
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	edx, DWORD PTR 8[rdx]
	mov	DWORD PTR 8[rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
	jmp	.L30
.L54:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
.L53:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L54
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR [rax]
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	edx, DWORD PTR 8[rdx]
	mov	DWORD PTR 8[rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rax], 0
.L30:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE4:
	.size	deletefromtree, .-deletefromtree
	.section	.rodata
.LC17:
	.string	"The Node Is Found -->%d \n\n\n"
	.align 8
.LC18:
	.string	"The Node Is Not Present In The Tree.\n\n"
	.text
	.globl	searcht
	.type	searcht, @function
searcht:
.LFB5:
	.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	DWORD PTR -20[rbp], edi
	mov	rax, QWORD PTR root[rip]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L57
.L61:
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	DWORD PTR -20[rbp], eax
	jne	.L58
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L59
.L58:
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	DWORD PTR -20[rbp], eax
	jge	.L60
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L57
.L60:
	mov	rax, QWORD PTR -16[rbp]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -16[rbp], rax
.L57:
	cmp	QWORD PTR -16[rbp], 0
	jne	.L61
.L59:
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	cmp	DWORD PTR -20[rbp], eax
	jne	.L62
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	mov	esi, eax
	lea	rdi, .LC17[rip]
	mov	eax, 0
	call	printf@PLT
	jmp	.L64
.L62:
	lea	rdi, .LC18[rip]
	call	puts@PLT
.L64:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE5:
	.size	searcht, .-searcht
	.section	.rodata
.LC19:
	.string	"%d->"
.LC20:
	.string	"%d-->"
	.text
	.globl	displayinorder
	.type	displayinorder, @function
displayinorder:
.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, 16
	mov	rax, QWORD PTR root[rip]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L66
.L72:
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	jne	.L67
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	mov	esi, eax
	lea	rdi, .LC19[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L66
.L67:
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -8[rbp], rax
	jmp	.L68
.L70:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -8[rbp], rax
.L68:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L69
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -16[rbp], rax
	jne	.L70
.L69:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	cmp	QWORD PTR -16[rbp], rax
	jne	.L71
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], 0
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	QWORD PTR -16[rbp], rax
	jmp	.L66
.L71:
	mov	rax, QWORD PTR -16[rbp]
	mov	eax, DWORD PTR 8[rax]
	mov	esi, eax
	lea	rdi, .LC20[rip]
	mov	eax, 0
	call	printf@PLT
	mov	rax, QWORD PTR -8[rbp]
	mov	rdx, QWORD PTR -16[rbp]
	mov	QWORD PTR 16[rax], rdx
	mov	rax, QWORD PTR -16[rbp]
	mov	rax, QWORD PTR [rax]
	mov	QWORD PTR -16[rbp], rax
.L66:
	cmp	QWORD PTR -16[rbp], 0
	jne	.L72
	nop
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	displayinorder, .-displayinorder
	.section	.rodata
.LC21:
	.string	"\n The Stack Is Full :"
	.text
	.globl	push
	.type	push, @function
push:
.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, 16
	mov	QWORD PTR -8[rbp], rdi
	mov	eax, DWORD PTR top[rip]
	cmp	eax, 99
	jne	.L74
	lea	rdi, .LC21[rip]
	call	puts@PLT
	jmp	.L76
.L74:
	mov	eax, DWORD PTR top[rip]
	add	eax, 1
	mov	DWORD PTR top[rip], eax
	mov	eax, DWORD PTR top[rip]
	cdqe
	lea	rcx, 0[0+rax*8]
	lea	rdx, s1[rip]
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR [rcx+rdx], rax
.L76:
	nop
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	push, .-push
	.section	.rodata
.LC22:
	.string	"\n The Stack Is Empty :"
	.text
	.globl	pop
	.type	pop, @function
pop:
.LFB8:
	.cfi_startproc
	endbr64
	push	rbp
	.cfi_def_cfa_offset 16
	.cfi_offset 6, -16
	mov	rbp, rsp
	.cfi_def_cfa_register 6
	mov	eax, DWORD PTR top[rip]
	cmp	eax, -1
	jne	.L78
	lea	rdi, .LC22[rip]
	call	puts@PLT
	jmp	.L80
.L78:
	mov	eax, DWORD PTR top[rip]
	sub	eax, 1
	mov	DWORD PTR top[rip], eax
.L80:
	nop
	pop	rbp
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	pop, .-pop
	.section	.rodata
.LC23:
	.string	"\nThe Tree Is Empty:"
.LC24:
	.string	"%d ->"
	.text
	.globl	stackpre
	.type	stackpre, @function
stackpre:
.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, 16
	mov	rax, QWORD PTR root[rip]
	test	rax, rax
	jne	.L82
	lea	rdi, .LC23[rip]
	call	puts@PLT
	jmp	.L81
.L82:
	mov	rax, QWORD PTR root[rip]
	mov	rdi, rax
	call	push
	jmp	.L84
.L86:
	mov	eax, DWORD PTR top[rip]
	cdqe
	lea	rdx, 0[0+rax*8]
	lea	rax, s1[rip]
	mov	rax, QWORD PTR [rdx+rax]
	mov	QWORD PTR -8[rbp], rax
	mov	eax, DWORD PTR top[rip]
	cdqe
	lea	rdx, 0[0+rax*8]
	lea	rax, s1[rip]
	mov	rax, QWORD PTR [rdx+rax]
	mov	eax, DWORD PTR 8[rax]
	mov	esi, eax
	lea	rdi, .LC24[rip]
	mov	eax, 0
	call	printf@PLT
	mov	eax, 0
	call	pop
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L85
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	push
.L85:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	je	.L84
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdi, rax
	call	push
.L84:
	mov	eax, DWORD PTR top[rip]
	cmp	eax, -1
	jne	.L86
.L81:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE9:
	.size	stackpre, .-stackpre
	.section	.rodata
.LC25:
	.string	"\n The Tree Is Empty"
	.text
	.globl	dpreorder
	.type	dpreorder, @function
dpreorder:
.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, 16
	mov	rax, QWORD PTR root[rip]
	test	rax, rax
	jne	.L88
	lea	rdi, .LC25[rip]
	call	puts@PLT
	jmp	.L87
.L88:
	mov	rax, QWORD PTR root[rip]
	mov	rdi, rax
	call	dpush
	jmp	.L90
.L92:
	mov	rax, QWORD PTR dtop[rip]
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR dtop[rip]
	mov	eax, DWORD PTR [rax]
	mov	esi, eax
	lea	rdi, .LC19[rip]
	mov	eax, 0
	call	printf@PLT
	mov	eax, 0
	call	dpop
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	test	rax, rax
	je	.L91
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR [rax]
	mov	rdi, rax
	call	push
.L91:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L90
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	push
.L90:
	mov	rax, QWORD PTR dtop[rip]
	test	rax, rax
	jne	.L92
.L87:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE10:
	.size	dpreorder, .-dpreorder
	.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	"51648.c"
	.text
	.global	root
	.bss
	.align	2
	.type	root, %object
	.size	root, 4
root:
	.space	4
	.comm	s1,400,4
	.global	top
	.data
	.align	2
	.type	top, %object
	.size	top, 4
top:
	.word	-1
	.global	dtop
	.bss
	.align	2
	.type	dtop, %object
	.size	dtop, 4
dtop:
	.space	4
	.section	.rodata
	.align	2
.LC0:
	.ascii	"\012Out of Memory Space:\000"
	.align	2
.LC1:
	.ascii	" This Value %d Has Inserted\012\000"
	.text
	.align	2
	.global	dpush
	.syntax unified
	.arm
	.fpu softvfp
	.type	dpush, %function
dpush:
	@ 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]
	mov	r0, #8
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L2
	ldr	r0, .L6
	bl	puts
	mov	r0, #0
	bl	exit
.L2:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, .L6+4
	bl	printf
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-12]
	str	r2, [r3]
	ldr	r3, .L6+8
	ldr	r2, [r3]
	ldr	r3, [fp, #-12]
	str	r2, [r3, #4]
	ldr	r3, .L6+8
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L3
	ldr	r2, .L6+8
	ldr	r3, [fp, #-12]
	str	r3, [r2]
	b	.L5
.L3:
	ldr	r3, .L6+12
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	ldr	r2, .L6+8
	ldr	r3, [fp, #-12]
	str	r3, [r2]
	ldr	r3, .L6+8
	ldr	r3, [r3]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #4]
.L5:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L7:
	.align	2
.L6:
	.word	.LC0
	.word	.LC1
	.word	dtop
	.word	top
	.size	dpush, .-dpush
	.section	.rodata
	.align	2
.LC2:
	.ascii	"\012  The Stack Is Under Flow Or Empty : \011 \000"
	.align	2
.LC3:
	.ascii	"\012 This Node Or Element %d Has Been Popped From T"
	.ascii	"he Stack : \011 \012\000"
	.text
	.align	2
	.global	dpop
	.syntax unified
	.arm
	.fpu softvfp
	.type	dpop, %function
dpop:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r3, .L12
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L9
	ldr	r0, .L12+4
	bl	puts
	b	.L11
.L9:
	ldr	r3, .L12
	ldr	r3, [r3]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, .L12+8
	bl	printf
	ldr	r3, .L12
	ldr	r3, [r3]
	ldr	r3, [r3, #4]
	ldr	r2, .L12
	str	r3, [r2]
.L11:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L13:
	.align	2
.L12:
	.word	dtop
	.word	.LC2
	.word	.LC3
	.size	dpop, .-dpop
	.section	.rodata
	.align	2
.LC4:
	.ascii	"\012 Operations Of Binary Search Tree\000"
	.align	2
.LC5:
	.ascii	"\012 Give Your Choice\000"
	.align	2
.LC6:
	.ascii	"\012 1. Insert \012 2. Delete A Specific Node Or El"
	.ascii	"ement \012 3. Display Nodes With In-Order Traversal"
	.ascii	" \012 4. Search A Node \012 5. Stack Version Pre-Or"
	.ascii	"der \012 6. Pre-Order Display With Dynamic Stack \012"
	.ascii	" 7. Exit \000"
	.align	2
.LC7:
	.ascii	"%d\000"
	.align	2
.LC8:
	.ascii	"\012 Give The Element\000"
	.align	2
.LC9:
	.ascii	"Give Node Data To Be Searched\000"
	.align	2
.LC10:
	.ascii	"\012 Stack Version Pre Order \000"
	.align	2
.LC11:
	.ascii	"\012 This Is The Dynamic Stack Version \000"
	.align	2
.LC12:
	.ascii	"\012 Okay Exiting Now Bye.....-->+_+<--\000"
	.align	2
.LC13:
	.word	__stack_chk_guard
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	ldr	r3, .L26
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	mov	r3,#0
.L24:
	ldr	r0, .L26+4
	bl	printf
	ldr	r0, .L26+8
	bl	printf
	ldr	r0, .L26+12
	bl	puts
	sub	r3, fp, #16
	mov	r1, r3
	ldr	r0, .L26+16
	bl	__isoc99_scanf
	ldr	r3, [fp, #-16]
	sub	r3, r3, #1
	cmp	r3, #6
	ldrls	pc, [pc, r3, asl #2]
	b	.L24
.L17:
	.word	.L23
	.word	.L22
	.word	.L21
	.word	.L20
	.word	.L19
	.word	.L18
	.word	.L16
.L23:
	bl	insertintree
	b	.L15
.L22:
	ldr	r0, .L26+20
	bl	puts
	sub	r3, fp, #12
	mov	r1, r3
	ldr	r0, .L26+16
	bl	__isoc99_scanf
	ldr	r3, [fp, #-12]
	mov	r0, r3
	bl	deletefromtree
	b	.L15
.L21:
	bl	displayinorder
	b	.L15
.L20:
	ldr	r0, .L26+24
	bl	puts
	sub	r3, fp, #12
	mov	r1, r3
	ldr	r0, .L26+16
	bl	__isoc99_scanf
	ldr	r3, [fp, #-12]
	mov	r0, r3
	bl	searcht
	b	.L15
.L19:
	ldr	r0, .L26+28
	bl	puts
	bl	stackpre
	b	.L15
.L18:
	ldr	r0, .L26+32
	bl	puts
	bl	dpreorder
	b	.L15
.L16:
	ldr	r0, .L26+36
	bl	puts
	mov	r0, #0
	bl	exit
.L15:
	b	.L24
.L27:
	.align	2
.L26:
	.word	.LC13
	.word	.LC4
	.word	.LC5
	.word	.LC6
	.word	.LC7
	.word	.LC8
	.word	.LC9
	.word	.LC10
	.word	.LC11
	.word	.LC12
	.size	main, .-main
	.section	.rodata
	.align	2
.LC14:
	.ascii	"\012Give Integer Data \012\000"
	.text
	.align	2
	.global	insertintree
	.syntax unified
	.arm
	.fpu softvfp
	.type	insertintree, %function
insertintree:
	@ args = 0, pretend = 0, frame = 16
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #16
	ldr	r3, .L36
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	mov	r0, #12
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r0, .L36+4
	bl	puts
	ldr	r3, [fp, #-8]
	add	r3, r3, #4
	mov	r1, r3
	ldr	r0, .L36+8
	bl	__isoc99_scanf
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
	ldr	r3, .L36
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L31
	ldr	r2, .L36
	ldr	r3, [fp, #-8]
	str	r3, [r2]
	b	.L35
.L33:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-8]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	cmp	r2, r3
	ble	.L32
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
	b	.L31
.L32:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-16]
.L31:
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L33
	ldr	r3, [fp, #-8]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	cmp	r2, r3
	bge	.L34
	ldr	r3, [fp, #-12]
	ldr	r2, [fp, #-8]
	str	r2, [r3]
	b	.L35
.L34:
	ldr	r3, [fp, #-12]
	ldr	r2, [fp, #-8]
	str	r2, [r3, #8]
.L35:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L37:
	.align	2
.L36:
	.word	root
	.word	.LC14
	.word	.LC7
	.size	insertintree, .-insertintree
	.section	.rodata
	.align	2
.LC15:
	.ascii	"The Tree Does Not Have Any Nodes Yet !!!\000"
	.align	2
.LC16:
	.ascii	"hello\000"
	.align	2
.LC17:
	.ascii	"\012 Now The Smallest Element From Right Sub Tree I"
	.ascii	"s Root !!! \012\000"
	.text
	.align	2
	.global	deletefromtree
	.syntax unified
	.arm
	.fpu softvfp
	.type	deletefromtree, %function
deletefromtree:
	@ args = 0, pretend = 0, frame = 24
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #24
	str	r0, [fp, #-24]
	ldr	r3, .L64
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	mov	r3, #0
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L41
	ldr	r0, .L64+4
	bl	puts
	b	.L38
.L45:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-24]
	cmp	r2, r3
	beq	.L63
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-24]
	cmp	r2, r3
	bge	.L44
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	str	r3, [fp, #-16]
	b	.L41
.L44:
	ldr	r3, [fp, #-16]
	str	r3, [fp, #-12]
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-16]
.L41:
	ldr	r3, [fp, #-16]
	cmp	r3, #0
	bne	.L45
	b	.L43
.L63:
	nop
.L43:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L46
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L46
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L47
	ldr	r3, [fp, #-12]
	mov	r2, #0
	str	r2, [r3, #8]
	b	.L38
.L47:
	ldr	r3, [fp, #-12]
	mov	r2, #0
	str	r2, [r3]
	b	.L38
.L46:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	beq	.L49
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	bne	.L49
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L50
	ldr	r3, [fp, #-16]
	ldr	r2, [r3]
	ldr	r3, [fp, #-12]
	str	r2, [r3, #8]
	b	.L38
.L50:
	ldr	r3, [fp, #-16]
	ldr	r2, [r3]
	ldr	r3, [fp, #-12]
	str	r2, [r3]
	b	.L38
.L49:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L52
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L52
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L53
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #8]
	ldr	r3, [fp, #-12]
	str	r2, [r3, #8]
	b	.L38
.L53:
	ldr	r3, [fp, #-16]
	ldr	r2, [r3, #8]
	ldr	r3, [fp, #-12]
	str	r2, [r3]
	b	.L38
.L52:
	ldr	r3, [fp, #-16]
	ldr	r3, [r3]
	cmp	r3, #0
	beq	.L38
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L38
	ldr	r3, [fp, #-16]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
	ldr	r3, .L64
	ldr	r3, [r3]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L55
	b	.L56
.L57:
	ldr	r0, .L64+8
	bl	puts
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
.L56:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L57
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r2, [r3, #4]
	ldr	r3, [fp, #-16]
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
	ldr	r0, .L64+12
	bl	puts
	b	.L38
.L55:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L61
	b	.L59
.L60:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
.L59:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L60
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	ldr	r2, [r2, #4]
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
	b	.L38
.L62:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
.L61:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L62
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	ldr	r2, [r2, #4]
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3]
.L38:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L65:
	.align	2
.L64:
	.word	root
	.word	.LC15
	.word	.LC16
	.word	.LC17
	.size	deletefromtree, .-deletefromtree
	.section	.rodata
	.align	2
.LC18:
	.ascii	"The Node Is Found -->%d \012\012\012\000"
	.align	2
.LC19:
	.ascii	"The Node Is Not Present In The Tree.\012\012\000"
	.text
	.align	2
	.global	searcht
	.syntax unified
	.arm
	.fpu softvfp
	.type	searcht, %function
searcht:
	@ 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, .L75
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	b	.L67
.L71:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L68
	ldr	r3, [fp, #-12]
	str	r3, [fp, #-8]
	b	.L69
.L68:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bge	.L70
	ldr	r3, [fp, #-12]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	b	.L67
.L70:
	ldr	r3, [fp, #-12]
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-12]
.L67:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L71
.L69:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	ldr	r2, [fp, #-16]
	cmp	r2, r3
	bne	.L72
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, .L75+4
	bl	printf
	b	.L74
.L72:
	ldr	r0, .L75+8
	bl	puts
.L74:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L76:
	.align	2
.L75:
	.word	root
	.word	.LC18
	.word	.LC19
	.size	searcht, .-searcht
	.section	.rodata
	.align	2
.LC20:
	.ascii	"%d->\000"
	.align	2
.LC21:
	.ascii	"%d-->\000"
	.text
	.align	2
	.global	displayinorder
	.syntax unified
	.arm
	.fpu softvfp
	.type	displayinorder, %function
displayinorder:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r3, .L85
	ldr	r3, [r3]
	str	r3, [fp, #-12]
	b	.L78
.L84:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L79
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, .L85+4
	bl	printf
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-12]
	b	.L78
.L79:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	b	.L80
.L82:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-8]
.L80:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L81
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-12]
	cmp	r2, r3
	bne	.L82
.L81:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r2, [fp, #-12]
	cmp	r2, r3
	bne	.L83
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #8]
	str	r3, [fp, #-12]
	b	.L78
.L83:
	ldr	r3, [fp, #-12]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, .L85+8
	bl	printf
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-12]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-12]
	ldr	r3, [r3]
	str	r3, [fp, #-12]
.L78:
	ldr	r3, [fp, #-12]
	cmp	r3, #0
	bne	.L84
	nop
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L86:
	.align	2
.L85:
	.word	root
	.word	.LC20
	.word	.LC21
	.size	displayinorder, .-displayinorder
	.section	.rodata
	.align	2
.LC22:
	.ascii	"\012 The Stack Is Full :\000"
	.text
	.align	2
	.global	push
	.syntax unified
	.arm
	.fpu softvfp
	.type	push, %function
push:
	@ 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, .L91
	ldr	r3, [r3]
	cmp	r3, #99
	bne	.L88
	ldr	r0, .L91+4
	bl	puts
	b	.L90
.L88:
	ldr	r3, .L91
	ldr	r3, [r3]
	add	r3, r3, #1
	ldr	r2, .L91
	str	r3, [r2]
	ldr	r3, .L91
	ldr	r3, [r3]
	ldr	r1, .L91+8
	ldr	r2, [fp, #-8]
	str	r2, [r1, r3, lsl #2]
.L90:
	nop
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L92:
	.align	2
.L91:
	.word	top
	.word	.LC22
	.word	s1
	.size	push, .-push
	.section	.rodata
	.align	2
.LC23:
	.ascii	"\012 The Stack Is Empty :\000"
	.text
	.align	2
	.global	pop
	.syntax unified
	.arm
	.fpu softvfp
	.type	pop, %function
pop:
	@ args = 0, pretend = 0, frame = 0
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	ldr	r3, .L97
	ldr	r3, [r3]
	cmn	r3, #1
	bne	.L94
	ldr	r0, .L97+4
	bl	puts
	b	.L96
.L94:
	ldr	r3, .L97
	ldr	r3, [r3]
	sub	r3, r3, #1
	ldr	r2, .L97
	str	r3, [r2]
.L96:
	nop
	pop	{fp, pc}
.L98:
	.align	2
.L97:
	.word	top
	.word	.LC23
	.size	pop, .-pop
	.section	.rodata
	.align	2
.LC24:
	.ascii	"\012The Tree Is Empty:\000"
	.align	2
.LC25:
	.ascii	"%d ->\000"
	.text
	.align	2
	.global	stackpre
	.syntax unified
	.arm
	.fpu softvfp
	.type	stackpre, %function
stackpre:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r3, .L105
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L100
	ldr	r0, .L105+4
	bl	puts
	b	.L99
.L100:
	ldr	r3, .L105
	ldr	r3, [r3]
	mov	r0, r3
	bl	push
	b	.L102
.L104:
	ldr	r3, .L105+8
	ldr	r3, [r3]
	ldr	r2, .L105+12
	ldr	r3, [r2, r3, lsl #2]
	str	r3, [fp, #-8]
	ldr	r3, .L105+8
	ldr	r3, [r3]
	ldr	r2, .L105+12
	ldr	r3, [r2, r3, lsl #2]
	ldr	r3, [r3, #4]
	mov	r1, r3
	ldr	r0, .L105+16
	bl	printf
	bl	pop
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L103
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	push
.L103:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	cmp	r3, #0
	beq	.L102
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r0, r3
	bl	push
.L102:
	ldr	r3, .L105+8
	ldr	r3, [r3]
	cmn	r3, #1
	bne	.L104
.L99:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L106:
	.align	2
.L105:
	.word	root
	.word	.LC24
	.word	top
	.word	s1
	.word	.LC25
	.size	stackpre, .-stackpre
	.section	.rodata
	.align	2
.LC26:
	.ascii	"\012 The Tree Is Empty\000"
	.text
	.align	2
	.global	dpreorder
	.syntax unified
	.arm
	.fpu softvfp
	.type	dpreorder, %function
dpreorder:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{fp, lr}
	add	fp, sp, #4
	sub	sp, sp, #8
	ldr	r3, .L113
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L108
	ldr	r0, .L113+4
	bl	puts
	b	.L107
.L108:
	ldr	r3, .L113
	ldr	r3, [r3]
	mov	r0, r3
	bl	dpush
	b	.L110
.L112:
	ldr	r3, .L113+8
	ldr	r3, [r3]
	str	r3, [fp, #-8]
	ldr	r3, .L113+8
	ldr	r3, [r3]
	ldr	r3, [r3]
	mov	r1, r3
	ldr	r0, .L113+12
	bl	printf
	bl	dpop
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	cmp	r3, #0
	beq	.L111
	ldr	r3, [fp, #-8]
	ldr	r3, [r3]
	mov	r0, r3
	bl	push
.L111:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L110
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	push
.L110:
	ldr	r3, .L113+8
	ldr	r3, [r3]
	cmp	r3, #0
	bne	.L112
.L107:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L114:
	.align	2
.L113:
	.word	root
	.word	.LC26
	.word	dtop
	.word	.LC20
	.size	dpreorder, .-dpreorder
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
