Binary Search Tree Using One Dimensional Array in C

A program to show how to write a binary search tree using a one-dimensional array using C programming language.

I am currently accepting programming work, IT projects, school and application development, programming projects, thesis and capstone projects, IT consulting work, computer tutorials, and web development work kindly contact me in the following email address for further details.  If you want to advertise on my website kindly contact me also in my email address also. Thank you.

My email address is the following jakerpomperada@gmail.com, jakerpomperada@aol.com, and jakerpomperada@yahoo.com.

My mobile number here in the Philippines is 09173084360.

My telephone number at home here in Bacolod City, Negros Occidental Philippines is  +63 (034) 4335675.

Here in Bacolod City, Negros Occidental I also accepting computer repair, networking and Arduino Project development at a very affordable price.

My Facebook address is https://www.facebook.com/profile.php?...

My personal website is http://www.jakerpomperada.com

My programming website is http://www.jakerpomperada.blogspot.com

I am also a book author you can purchase my books on computer programming and information technology in the following links below.

https://www.mindshaperspublishing.com/

https://www.unlimitedbooksph.com/

Thank you very much for your help and support.

Program Listing

#include <stdio.h>

#include <conio.h>

#include <alloc.h>

struct node

{

struct node *left ;

char data ;

struct node *right ;

} ;

struct node * buildtree ( int ) ;

void inorder ( struct node * ) ;

char arr[ ] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', '\0', '\0', 'H' } ;

int   lc[ ] = {  1,   3,   5,   -1,   9,  -1,  -1,   -1,   -1,  -1 } ;

int   rc[ ] = {  2,   4,   6,   -1,  -1,  -1,  -1,   -1,   -1,  -1 } ;

void main( )

{

struct node *root ;

root = buildtree ( 0 ) ;

printf ( “In-order Traversal:\n” ) ;

inorder ( root ) ;

getch( ) ;

}

struct node * buildtree ( int index )

{

struct node *temp = NULL ;

if ( index != -1 )

{

temp = ( struct node * ) malloc ( sizeof ( struct node ) ) ;

temp -> left = buildtree ( lc[index] ) ;

temp -> data = arr[index] ;

temp -> right = buildtree ( rc[index] ) ;

}

return temp ;

}

void inorder ( struct node *root )

{

if ( root != NULL )

{

inorder ( root -> left ) ;

printf ( "%c\t", root -> data ) ;

inorder ( root -> right ) ;

}

}