	.file	"134087.c"
	.intel_syntax noprefix
	.text
	.globl	is_bst
	.data
	.align 4
	.type	is_bst, @object
	.size	is_bst, 4
is_bst:
	.long	1
	.text
	.globl	create_node
	.type	create_node, @function
create_node:
.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	DWORD PTR -20[rbp], edi
	mov	edi, 24
	call	malloc@PLT
	mov	QWORD PTR -8[rbp], rax
	mov	rax, QWORD PTR -8[rbp]
	mov	edx, DWORD PTR -20[rbp]
	mov	DWORD PTR [rax], edx
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 8[rax], 0
	mov	rax, QWORD PTR -8[rbp]
	mov	QWORD PTR 16[rax], 0
	mov	rax, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE6:
	.size	create_node, .-create_node
	.globl	check_bst
	.type	check_bst, @function
check_bst:
.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
	cmp	QWORD PTR -8[rbp], 0
	je	.L8
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	test	rax, rax
	je	.L6
	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
	jge	.L6
	mov	DWORD PTR is_bst[rip], -1
	jmp	.L3
.L6:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	test	rax, rax
	je	.L7
	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
	jle	.L7
	mov	DWORD PTR is_bst[rip], -1
	jmp	.L3
.L7:
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 8[rax]
	mov	rdi, rax
	call	check_bst
	mov	rax, QWORD PTR -8[rbp]
	mov	rax, QWORD PTR 16[rax]
	mov	rdi, rax
	call	check_bst
	jmp	.L3
.L8:
	nop
.L3:
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE7:
	.size	check_bst, .-check_bst
	.section	.rodata
.LC0:
	.string	"It is a Binary-Search-Tree"
	.align 8
.LC1:
	.string	"It is not a Binary Search Tree"
	.text
	.globl	main
	.type	main, @function
main:
.LFB8:
	.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, 24
	.cfi_offset 3, -24
	mov	edi, 10
	call	create_node
	mov	QWORD PTR -24[rbp], rax
	mov	edi, 9
	call	create_node
	mov	rdx, QWORD PTR -24[rbp]
	mov	QWORD PTR 8[rdx], rax
	mov	edi, 11
	call	create_node
	mov	rdx, QWORD PTR -24[rbp]
	mov	QWORD PTR 16[rdx], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rbx, QWORD PTR 8[rax]
	mov	edi, 8
	call	create_node
	mov	QWORD PTR 8[rbx], rax
	mov	rax, QWORD PTR -24[rbp]
	mov	rdi, rax
	call	check_bst
	mov	eax, DWORD PTR is_bst[rip]
	cmp	eax, 1
	jne	.L10
	lea	rdi, .LC0[rip]
	call	puts@PLT
	jmp	.L11
.L10:
	lea	rdi, .LC1[rip]
	call	puts@PLT
.L11:
	mov	eax, 0
	mov	rbx, QWORD PTR -8[rbp]
	leave
	.cfi_def_cfa 7, 8
	ret
	.cfi_endproc
.LFE8:
	.size	main, .-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	"134087.c"
	.text
	.global	is_bst
	.data
	.align	2
	.type	is_bst, %object
	.size	is_bst, 4
is_bst:
	.word	1
	.text
	.align	2
	.global	create_node
	.syntax unified
	.arm
	.fpu softvfp
	.type	create_node, %function
create_node:
	@ 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, #12
	bl	malloc
	mov	r3, r0
	str	r3, [fp, #-8]
	ldr	r3, [fp, #-8]
	ldr	r2, [fp, #-16]
	str	r2, [r3]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #4]
	ldr	r3, [fp, #-8]
	mov	r2, #0
	str	r2, [r3, #8]
	ldr	r3, [fp, #-8]
	mov	r0, r3
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
	.size	create_node, .-create_node
	.align	2
	.global	check_bst
	.syntax unified
	.arm
	.fpu softvfp
	.type	check_bst, %function
check_bst:
	@ 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	.L8
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	cmp	r3, #0
	beq	.L6
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	ldr	r3, [r3]
	cmp	r2, r3
	bge	.L6
	ldr	r3, .L9
	mvn	r2, #0
	str	r2, [r3]
	b	.L3
.L6:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	cmp	r3, #0
	beq	.L7
	ldr	r3, [fp, #-8]
	ldr	r2, [r3]
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	ldr	r3, [r3]
	cmp	r2, r3
	ble	.L7
	ldr	r3, .L9
	mvn	r2, #0
	str	r2, [r3]
	b	.L3
.L7:
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #4]
	mov	r0, r3
	bl	check_bst
	ldr	r3, [fp, #-8]
	ldr	r3, [r3, #8]
	mov	r0, r3
	bl	check_bst
	b	.L3
.L8:
	nop
.L3:
	sub	sp, fp, #4
	@ sp needed
	pop	{fp, pc}
.L10:
	.align	2
.L9:
	.word	is_bst
	.size	check_bst, .-check_bst
	.section	.rodata
	.align	2
.LC0:
	.ascii	"It is a Binary-Search-Tree\000"
	.align	2
.LC1:
	.ascii	"It is not a Binary Search Tree\000"
	.text
	.align	2
	.global	main
	.syntax unified
	.arm
	.fpu softvfp
	.type	main, %function
main:
	@ args = 0, pretend = 0, frame = 8
	@ frame_needed = 1, uses_anonymous_args = 0
	push	{r4, fp, lr}
	add	fp, sp, #8
	sub	sp, sp, #12
	mov	r0, #10
	bl	create_node
	str	r0, [fp, #-16]
	mov	r0, #9
	bl	create_node
	mov	r2, r0
	ldr	r3, [fp, #-16]
	str	r2, [r3, #4]
	mov	r0, #11
	bl	create_node
	mov	r2, r0
	ldr	r3, [fp, #-16]
	str	r2, [r3, #8]
	ldr	r3, [fp, #-16]
	ldr	r4, [r3, #4]
	mov	r0, #8
	bl	create_node
	mov	r3, r0
	str	r3, [r4, #4]
	ldr	r0, [fp, #-16]
	bl	check_bst
	ldr	r3, .L15
	ldr	r3, [r3]
	cmp	r3, #1
	bne	.L12
	ldr	r0, .L15+4
	bl	puts
	b	.L13
.L12:
	ldr	r0, .L15+8
	bl	puts
.L13:
	mov	r3, #0
	mov	r0, r3
	sub	sp, fp, #8
	@ sp needed
	pop	{r4, fp, pc}
.L16:
	.align	2
.L15:
	.word	is_bst
	.word	.LC0
	.word	.LC1
	.size	main, .-main
	.ident	"GCC: (Ubuntu 9.4.0-1ubuntu1~20.04.2) 9.4.0"
	.section	.note.GNU-stack,"",%progbits
