How Will I Implement A Binary Search Tree Using Array In C

Why do most C++ implementations of binary search trees use pointers to store nodes?

This is not accurate. It doesn’t use pointer to store nodes, it uses pointer to “reference” where nodes are actually stored. Nodes are stored in dynamic allocated memory (heap).So. what actually a pointer is?A pointer variable in C/C++ is a variable storing a address of unsigned integer value(64 bit long in x86–64 system). It uses the same memory as a normal 64 bit integer valuable.A type of a pointer give the meaning of the pointer variable in compile time. For example:int *p;This means that the value in p is the memory address of an integer variable.

How do I sort data using BST tree and How can I implement BST tree in C?

BST is way in which Data is arranged in such a Logical Manner Where if you run In-Order Traversal,  you can get all data in Sorted Order. BST Implementation : C Program to Construct a Binary Search Tree and perform deletion and inorder traversalGenerally you don't need to sort Data Stored in BST Explicitly , There Are already arranged sorted in logical way.

I am writing a program to create a binary search tree and display sorted data. How can I do that in C programming easily give me full code?

Here is code for in-order traversal in binary search tree .#include
#include
struct node// Structure for node
{
int data;
struct node *LCHILD;
struct node *RCHILD;
}*tree;
struct node *create(int val)// create new node
{
struct node *temp;
temp=(struct node*)malloc(sizeof(struct node));
temp->data=val;
temp->LCHILD=NULL;
temp->RCHILD=NULL;
return temp;
}
void print_inorder(struct node *tr)// inorder traversal
{
struct node *copy,*p;
copy=(struct node*)malloc(sizeof(struct node));
p=(struct node*)malloc(sizeof(struct node));
copy=tr;
if(copy==NULL)
{
printf("EMPTY TREE\n");
return ;
}
if(copy->LCHILD!=NULL)
print_inorder
(copy->LCHILD);
printf("%d\t",copy->data);
if(copy->RCHILD!=NULL)
print_inorder(copy->RCHILD);
}
void add(struct node **tr,int val)// for adding node in tree
{
struct node *copy,*copy1;
copy=(struct node*)malloc(sizeof(struct node));
copy1=(struct node*)malloc(sizeof(struct node));
copy1=*tr;
if(copy1==NULL)
{
*tr=create(val);
return ;
}
if(val>=copy1->data)
add(&(copy1->RCHILD),val);
else
add(&(copy1->LCHILD),val);
}
int main()
{
tree=NULL;
REPEAT:
printf("ENTER YOUR CHOICE\n");
printf("1->add node to tree\n");
printf("2->print in INORDER tree\n");
printf("3->exit\n");
int choice,val;
scanf("%d",&choice);
switch(choice)
{
case 1:
scanf("%d",&val);
add(&tree,val);
break;
case 2:
print_inorder(tree);
break;
case 3:
exit(2);
default:
printf("your choice is incorrect\n");
}
goto REPEAT;
return 0;
}

Do we need to have a sorted array in order to perform binary search?

Binary Search works on Divide and Conquer paradigm .It compares the middle element of the array with the value to be searched so that it can skip searching the half of the array in the next iteration.Let say we want to search for X=8 from the array [4,2,11,14,8,24,15,17].Now if we apply Binary Search on this unsorted array ,it will not be able to find the value X=8. As according to Binary Search algorithm, it first find the middle element element of the array which is 14. It compares X=8 with 14 and as (X=8)<14, it search for the value X in the first half of the array[4,2,11] in the next iteration. So it wont be able to find the value.But If the array is sorted[2,4,8,11,14,15,17,24] then it is confirmed that if (X<(mid_value=11)) then it will appear in the first half of the array unless the value X is not present in the array.