Program for binary search tree in C

In binary search tree,

The first number that we insert is the root element and every other number that is entered in the binary search tree is compared with the root element.

If the new number is > the root element then it is put in the right sub-tree.

And if new number is < the root element then it is put in the left sub-tree.

 

Program:

 

Entering data in file using file handling in C [Program]

 

 

Output:

A file named material.txt will be creasted automatcially in the location where your .c file is present.

Here are the screenshots:

1.1 1.2 1.3

Program to display, add and subtract two value of times in HRS, Minutes and Seconds using structures

Code:

 

Program to to read and display data of students using an array of pointers

Output:

21_3

Program to to calculate distance b/w two heights passing structure as pointers to the function

21_2

Program to add and subtract two complex numbers using structures.

 

Output:

21_1

Program to read display add and subtract the two distances using structures

 

Output:

14_3

Passing members of structure student by using call by reference.

 

Output:

14_2

Program to read and display information of a student using structure within the structure.

 

Output:

14mar_1

Program to read and display information of a student using structure within the structure


14mar_1