#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 EV_tnode {
  int dummy;
};
struct EV_node {
  int dummy;
};

/* Variables and functions */
scalar_t__ _bintreesearch(struct EV_tnode *, int);
struct EV_tnode *_buildTree(struct EV_node *);
int /*<<< orphan*/ _freeList(struct EV_node *);
int /*<<< orphan*/ _freeTree(struct EV_tnode *);
struct EV_node *_inOrder(struct EV_tnode *);
struct EV_node *_postOrder(struct EV_tnode *);
int /*<<< orphan*/ _printList(struct EV_node *);
int /*<<< orphan*/ _treeprint(struct EV_tnode *);
scalar_t__ _treesearch(struct EV_tnode *, int);
int /*<<< orphan*/ printf(char *, long);
void _treeMain(struct EV_node *EV_list) {
  struct EV_tnode *EV_root;
  struct EV_node *EV_inList;
  struct EV_node *EV_postList;
  EV_root = _buildTree(EV_list);
  _treeprint(EV_root);
  printf("%ld\n", (long)(-999));
  EV_inList = _inOrder(EV_root);
  _printList(EV_inList);
  printf("%ld\n", (long)(-999));
  _freeList(EV_inList);
  EV_postList = _postOrder(EV_root);
  _printList(EV_postList);
  printf("%ld\n", (long)(-999));
  _freeList(EV_postList);
  printf("%ld\n", (long)_treesearch(EV_root, 0));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, 10));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, (-2)));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, 2));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, 3));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, 9));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_treesearch(EV_root, 1));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 0));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 10));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, (-2)));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 2));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 3));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 9));
  printf("%ld\n", (long)(-999));
  printf("%ld\n", (long)_bintreesearch(EV_root, 1));
  printf("%ld\n", (long)(-999));
  _freeTree(EV_root);
}


x86 assembly (clang, -O0):
<_treeMain>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    -0x8(%rbp),%rdi
call   10c0 <_buildTree@plt>
mov    %rax,-0x10(%rbp)
mov    -0x10(%rbp),%rdi
call   1030 <_treeprint@plt>
lea    0xe37(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
call   1090 <_inOrder@plt>
mov    %rax,-0x18(%rbp)
mov    -0x18(%rbp),%rdi
call   1070 <_printList@plt>
lea    0xe0e(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x18(%rbp),%rdi
call   1060 <_freeList@plt>
mov    -0x10(%rbp),%rdi
call   1040 <_postOrder@plt>
mov    %rax,-0x20(%rbp)
mov    -0x20(%rbp),%rdi
call   1070 <_printList@plt>
lea    0xddc(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x20(%rbp),%rdi
call   1060 <_freeList@plt>
mov    -0x10(%rbp),%rdi
xor    %esi,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xdb2(%rip),%rdi
call   1050 <printf@plt>
lea    0xda6(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0xa,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xd82(%rip),%rdi
call   1050 <printf@plt>
lea    0xd76(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0xfffffffe,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xd52(%rip),%rdi
call   1050 <printf@plt>
lea    0xd46(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x2,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xd22(%rip),%rdi
call   1050 <printf@plt>
lea    0xd16(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x3,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xcf2(%rip),%rdi
call   1050 <printf@plt>
lea    0xce6(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x9,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xcc2(%rip),%rdi
call   1050 <printf@plt>
lea    0xcb6(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x1,%esi
call   10a0 <_treesearch@plt>
mov    %rax,%rsi
lea    0xc92(%rip),%rdi
call   1050 <printf@plt>
lea    0xc86(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
xor    %esi,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xc65(%rip),%rdi
call   1050 <printf@plt>
lea    0xc59(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0xa,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xc35(%rip),%rdi
call   1050 <printf@plt>
lea    0xc29(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0xfffffffe,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xc05(%rip),%rdi
call   1050 <printf@plt>
lea    0xbf9(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x2,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xbd5(%rip),%rdi
call   1050 <printf@plt>
lea    0xbc9(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x3,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xba5(%rip),%rdi
call   1050 <printf@plt>
lea    0xb99(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x9,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xb75(%rip),%rdi
call   1050 <printf@plt>
lea    0xb69(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
mov    $0x1,%esi
call   10b0 <_bintreesearch@plt>
mov    %rax,%rsi
lea    0xb45(%rip),%rdi
call   1050 <printf@plt>
lea    0xb39(%rip),%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    -0x10(%rbp),%rdi
call   1080 <_freeTree@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<_treeMain>:
push   %r15
push   %r14
push   %rbx
call   10c0 <_buildTree@plt>
mov    %rax,%r15
mov    %rax,%rdi
call   1030 <_treeprint@plt>
lea    0xe44(%rip),%r14
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
call   1090 <_inOrder@plt>
mov    %rax,%rbx
mov    %rax,%rdi
call   1070 <_printList@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %rbx,%rdi
call   1060 <_freeList@plt>
mov    %r15,%rdi
call   1040 <_postOrder@plt>
mov    %rax,%rbx
mov    %rax,%rdi
call   1070 <_printList@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %rbx,%rdi
call   1060 <_freeList@plt>
mov    %r15,%rdi
xor    %esi,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0xa,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0xfffffffe,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x2,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x3,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x9,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x1,%esi
call   10a0 <_treesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
xor    %esi,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0xa,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0xfffffffe,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x2,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x3,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x9,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
mov    $0x1,%esi
call   10b0 <_bintreesearch@plt>
mov    %r14,%rdi
mov    %rax,%rsi
call   1050 <printf@plt>
mov    %r14,%rdi
mov    $0xfffffffffffffc19,%rsi
call   1050 <printf@plt>
mov    %r15,%rdi
pop    %rbx
pop    %r14
pop    %r15
jmp    1080 <_freeTree@plt>

LLVM IR (-O0):
%struct.EV_node = type { i32 }
%struct.EV_tnode = type { i32 }
@.str = [5 x i8] c"%ld\0A\00"
define void @_treeMain(%struct.EV_node* %0) {
%2 = alloca %struct.EV_node*
%3 = alloca %struct.EV_tnode*
%4 = alloca %struct.EV_node*
%5 = alloca %struct.EV_node*
store %struct.EV_node* %0, %struct.EV_node** %2
%6 = load %struct.EV_node*, %struct.EV_node** %2
%7 = call %struct.EV_tnode* @_buildTree(%struct.EV_node* %6)
store %struct.EV_tnode* %7, %struct.EV_tnode** %3
%8 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%9 = call i32 @_treeprint(%struct.EV_tnode* %8)
%10 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%11 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%12 = call %struct.EV_node* @_inOrder(%struct.EV_tnode* %11)
store %struct.EV_node* %12, %struct.EV_node** %4
%13 = load %struct.EV_node*, %struct.EV_node** %4
%14 = call i32 @_printList(%struct.EV_node* %13)
%15 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%16 = load %struct.EV_node*, %struct.EV_node** %4
%17 = call i32 @_freeList(%struct.EV_node* %16)
%18 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%19 = call %struct.EV_node* @_postOrder(%struct.EV_tnode* %18)
store %struct.EV_node* %19, %struct.EV_node** %5
%20 = load %struct.EV_node*, %struct.EV_node** %5
%21 = call i32 @_printList(%struct.EV_node* %20)
%22 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%23 = load %struct.EV_node*, %struct.EV_node** %5
%24 = call i32 @_freeList(%struct.EV_node* %23)
%25 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%26 = call i64 @_treesearch(%struct.EV_tnode* %25, i32 0)
%27 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %26)
%28 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%29 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%30 = call i64 @_treesearch(%struct.EV_tnode* %29, i32 10)
%31 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %30)
%32 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%33 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%34 = call i64 @_treesearch(%struct.EV_tnode* %33, i32 -2)
%35 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %34)
%36 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%37 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%38 = call i64 @_treesearch(%struct.EV_tnode* %37, i32 2)
%39 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %38)
%40 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%41 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%42 = call i64 @_treesearch(%struct.EV_tnode* %41, i32 3)
%43 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %42)
%44 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%45 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%46 = call i64 @_treesearch(%struct.EV_tnode* %45, i32 9)
%47 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %46)
%48 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%49 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%50 = call i64 @_treesearch(%struct.EV_tnode* %49, i32 1)
%51 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %50)
%52 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%53 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%54 = call i64 @_bintreesearch(%struct.EV_tnode* %53, i32 0)
%55 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %54)
%56 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%57 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%58 = call i64 @_bintreesearch(%struct.EV_tnode* %57, i32 10)
%59 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %58)
%60 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%61 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%62 = call i64 @_bintreesearch(%struct.EV_tnode* %61, i32 -2)
%63 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %62)
%64 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%65 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%66 = call i64 @_bintreesearch(%struct.EV_tnode* %65, i32 2)
%67 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %66)
%68 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%69 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%70 = call i64 @_bintreesearch(%struct.EV_tnode* %69, i32 3)
%71 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %70)
%72 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%73 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%74 = call i64 @_bintreesearch(%struct.EV_tnode* %73, i32 9)
%75 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %74)
%76 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%77 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%78 = call i64 @_bintreesearch(%struct.EV_tnode* %77, i32 1)
%79 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %78)
%80 = call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%81 = load %struct.EV_tnode*, %struct.EV_tnode** %3
%82 = call i32 @_freeTree(%struct.EV_tnode* %81)
ret void
}

LLVM IR (-O2):
%struct.EV_node = type { i32 }
%struct.EV_tnode = type { i32 }
@.str = [5 x i8] c"%ld\0A\00"
define void @_treeMain(%struct.EV_node* %0) {
%2 = tail call %struct.EV_tnode* @_buildTree(%struct.EV_node* %0)
%3 = tail call i32 @_treeprint(%struct.EV_tnode* %2)
%4 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%5 = tail call %struct.EV_node* @_inOrder(%struct.EV_tnode* %2)
%6 = tail call i32 @_printList(%struct.EV_node* %5)
%7 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%8 = tail call i32 @_freeList(%struct.EV_node* %5)
%9 = tail call %struct.EV_node* @_postOrder(%struct.EV_tnode* %2)
%10 = tail call i32 @_printList(%struct.EV_node* %9)
%11 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%12 = tail call i32 @_freeList(%struct.EV_node* %9)
%13 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 0)
%14 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %13)
%15 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%16 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 10)
%17 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %16)
%18 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%19 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 -2)
%20 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %19)
%21 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%22 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 2)
%23 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %22)
%24 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%25 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 3)
%26 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %25)
%27 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%28 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 9)
%29 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %28)
%30 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%31 = tail call i64 @_treesearch(%struct.EV_tnode* %2, i32 1)
%32 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %31)
%33 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%34 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 0)
%35 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %34)
%36 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%37 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 10)
%38 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %37)
%39 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%40 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 -2)
%41 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %40)
%42 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%43 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 2)
%44 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %43)
%45 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%46 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 3)
%47 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %46)
%48 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%49 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 9)
%50 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %49)
%51 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%52 = tail call i64 @_bintreesearch(%struct.EV_tnode* %2, i32 1)
%53 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 %52)
%54 = tail call i32 @printf(i8* getelementptr inbounds ([5 x i8], [5 x i8]* @.str, i64 0, i64 0), i64 -999)
%55 = tail call i32 @_freeTree(%struct.EV_tnode* %2)
ret void
}