Anna University - Data Structure and Algorithm (DSA) - 2011 Nov / Dec Question Paper

B.E / B.Tech DEGREE EXAMINATION NOVEMBER / December 2011

Common to B.E.(EEE/EIE/ICE)

Third Semester

DATA STRUCTURES AND ALGORITHMS

(Regulation 2010)

Time: Three hours

Maximum: 100 marks

Answer ALL questions

PART A - (10*2=2O marks)

1. Define Abstract Data Type.
2. Mention the advantages of representing stacks using linked lists than arrays.
3 State the properties of a binary tree.
4. Draw a directed tree representation of the formula (a + b * c)+ ((d * e ÷ f) * g).
5. In an AVL tree, at what condition the balancing is to be done?
6. What is collision hashing?
7. What do you mean by depth-first traversal?
8. What is mean by topological sorting?
9 Write lown the best,average and worst case complexity of Quick and Merge sort.
IO.State the various asymptotic relations used for denoting Time complexity.

PART B    (5x16 = 80 marks)

11. (a) Explain operations of Doubly linked List in detail with routine of add, delete node from DLL.

Or

(b) Write an algorithm for covert infix expression to postfix expresion with an example of 

(A + (B * C - (D/E^F)* G)*H).

12. (a) (i) Illustrate the construction of tree of a binary tree given its in order and postorder traversal.
in-order:     H D I  J E K B A L F M C N G O
Post-order: H I D J K E B L M F N O G C A

(ii) To find inorder, preorder and postorder for a given tree (6)

Or

(b) Narrate the operation of Binary search tree on searching a node, Insertion node and deletion of a node from binary tree with example.

13. (a) Discuss about AVL Trees

Or

(b) (i) Briefly explain the hash function in detail (6)

(ii) Narrate B-Tree operations. (10)

14. (a)Explain the followiag with algorithm
(i)DFS (4
(ii)BFS (4)
(iii)Kruskal algorithm with example. (8)

Or

(b) Explain Single source path algorithm with an example. Does the algorithm work for paths of negative values? Explain.

15. (a) Explain the following with algorithm
(i) Finduig Maximum and Minimum. (8)
(ii) Binary Search. (8)

Or

(b) Explain how the traveling salesman problem can be solved using greedy algorithm.

Anna University - Data Structure and Algorithm (DSA) - Nov / Dec 2006 - Question Paper

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2006.

Third Semester

Electrical and Electronics Engineering

DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation / Instrumentation and Control Engineering)

(Regulation 2004)

Time : Three hours

Maximum: 100 marks
Answer ALL questions.

PART A — (10 x 2 = 20 marks)

1. What is the purpose of the do-while statement? How does it differ from the
while statement.

2. What is recursion? What advantages is there in its use?

3. State the different application of stack.

4. What is the significance of priority queue?

5. What are the disadvantages of sequential representation of tree over the linked representation?

6. What is the use of threaded binary tree?

7. When is the need of external sort? Give example.

8. Define address calculation sort.

9. What are strongly connected graph? Give example.

10. State any two application of depth first traversal.

PARTB—(5 x 16=80 marks)

11. (a) (i) Name the four storage class specifications are included in C. Explain them with suitable example. (8)

(ii) Write a for ioop that will read the charter type array called text and write the characters backwards into another charter type array called back_text. Assume that the text contains 80 characters. (8)

Or

(b) (i) Write a C program that reads several different names and addresses into the computer, rearrange the names into alphabetic order, and then write out the alphabetize list. Make use of structure variable within the program. (10)

(ii) State the difference between call-by-value and call-by-reference? Give a suitable example. (6)

12. (a) Compare the following with suitable example. (2 x 8 = 16)
(j) Linked list and array
(ii) Singly linked list and Doubly linked list.

Or

(b) i) What are the advantages of circular linked list? Write down the various primitive operations performed on circular linked list. Write the algorithm for insertion of element in the circular linked list. (8)

(ii) Write a C program to perform the following operation on a queue
(1) Insert
(2) Delete and

(3) Display. (8)

13. (a) (i) Write a note on expression tree with suitable example. (6)

(ii) Write a C program to perform following operations in a binary tree.
(1) To search for particular information
(2) To compute number of nodes in a tree. (10)

Or

(b) (i) Write a C pseudo code to create, insert and delete a node recursively in Binary search tree. (10)

(ii) Draw the complete undirected graphs with five vertices. Prove that the number of edges in an n vertices complete graph is n (n -1)/2. (6)

14. (a) (i) Devise an algorithm for an insertion sort. (6)
(ii) What are different types of sorting techniques? Write an algorithm for shell sort and explain it with example. (10)

Or

(b) (i) Write notes on interpolation search with suitable example. (9)

(ii) Why do we say quick sort is an unstable sorting method? Write an algorithm to prove the same. (7)

15. (a) (i) Devise a round robin algorithm. Explain it in detail with a suitable example. (8)

(ii) State the array and the linked representation of graphs with example. (8)

Or

(b) (i) What are the different graph traversal methods? Explain them with example. (8)

(ii) Give an algorithm to find a shortest path in a graph. Explain it with a suitable example. (8)

Anna University - Data Structure and Algorithm (DSA) - May / June 2007 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2007.

Third Semester

Electrical and Electronics Engineering

DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation Engineering / Instrumentation and Control Engineering)

(Regulations 2004)

Time: Three hours

Maximum: 100 marks

Answer ALL questions.

PARTA—(10x2 =20 marks)

1. Write code for generating fibonacci sequence recursively.

2. How do you access the  address where the element of a matrix, whose index is given, is stored?

3. Justify queue as ADT.

4. Write simple code to traverse through DLL.

5. Construct a binary tree for the following Infix expression: A + B * C/D.

6. Perform post order traversal for the following binary tree:

7. Give examples of sorting techniques that is not based on Divide and Conquer algorithmic technique.

8. What is the best case and worst case complexity of merge sort?
9. What are spanning forests? Discuss.
10. What is an adjacency matrix used for? Discuss.

PARTB—(5x 16=80 marks)

11. (a) How do you implement union, structures and arrays in C? Explain with suitable examples. (6 + 4 + 6)

Or

(b) (i) Write algorithm for reversing the elements of an array (one dimensional). (6)

(ii) Write a C program to find the product of a matrix A and its transpose. (10)

12. (a) (i) Write algorithms for insertion and deletion of nodes in a
(1) Stack (5)
(2) Circular List (5)

(ii) What is a priority queue? State the advantages with reference to implementation. (6)

Or

(b) Define a header node in Doubly Linked List. How do you merge two Doubly Linked Lists into a sing1e one? Compare with Circular Linked List. Write suitable algorithms.

13. (a) What is threaded binary tree? How do you represent binary tree using list? Write algorithms for finding the Kth element. 

Or

(b) (i) Develop a ‘C’ program to implement a binary tree. Discuss how evaluation of expressions are handled using a binary tree structure.  (10)

(ii) What are the applications of binary tree data structure? Explain. (6)

14. (a) Explain algorithms for bubble sort and selection sort. Which one of these outperforms? Why? Discuss.

Or

(b) Describe with suitable algorithms for indexed sequential search, binary search and interpolation search schemes.

15. (a) Describe BFS and DFS methods for graphs with suitable algorithms. How efficiencies are computed?

Or

(b) Write algorithm for finding minimum spanning tree and explain applications. Illustrate the algorithm with typical data of your own.

Anna University - Data Structure and Algorithm (DSA) - April / May 2011 - Question Paper Two Marks with Answers

B.Tech. DEGREE EXAMINATION, APRIL/MAY 2011 - Third Semester

Electrical and Electronics Engineering

DATA STRUCTURES AND ALGORITHMS - (Regulation 2008)

Two Marks with Answers

 1.Define Stack. What are the operations performed on a stack?

A stack is a linear data structure which follows Last In First Out (LIFO) principle, in which both insertion and deletion occur at only one end of the list called top.

The fundamental operations on the stack are :-
(j) PUSH - equivalent to insert
(ii) POP - equivalent to delete.

2.Mention the applications of list.

1. Polynomial ADT.
2. Radix sort.
3. Multilist,

3.Define tree. List the tree traversal techniques.

A tree is a collection of nodes. The collection can be empty, otherwise, a tree consists of a distinguished node r, called the root, and zero or more non empty (sub) trees T1, T2 Tk each of whose roots are connected by a directed edge from r.

Traversing means visiting each node only,once. Tree traversal is a method for visiting all the nodes in the tree exactly once.

There are three types of tree traversal techniques, namely:
1. Inorder traversal
2. Preorder traversal
3. Post order traversal.

4. Differentiate a binary tree from a binary search tree.

Binary search tree is a binary tree in which for every node X in the tree, the values of all the keys in its left subtree are smaller than the key value in X, and the values of all the keys in its right subtree are larger than the key value in X.

5. What is meant by binary heaps.

The efficient way of implementing priority queue is binary is Binary heap is merely referred as heaps, Heaps have two properties namely.
* Structure property .
* Heap order property

6. What is linear hashing? Specify its merits and demerits.

In linear hashing f (key) directly refers to value.
Best case time complexity 0(1)
Worst case time complexity 0(n) .

7.What is meant by digraph? Define the terms in-degree and out-degree with respect to a digraph.

A directed graph or digraph is a pair G = (V,E) where V is a set whose elements are called vertices (nodes) and E is a set of ordered pairs of elements of V (edges or directed edges or arcs). For directed edge (v, w) in E, v is its tail and w its head, (v;w) is represented in the diagrams as the arrow, v -> w, (ie)
simply vw.

Indegree of a Node = No.of incoming edges (nodes)
Outdegree of a Node = No. of outgoing edges (nodes)

8. Write the adjacency matrix for the following graph.

9.What is dynamic programming? Give two examples.

Dynamic programming is one of the optimal algorithm technique when comparing to other methods. What is the advantage of this method? From which classification it has been derived?
Examples:

Sorting by distribution counting.

Horspool's algorithm.

10.What is meant by NP-complete problem.

A problem L is NP-complete if & only if L is NP hard & L E NP.

Data Structure and Algorithm - Heap (SlideShow)

Download Link: Click Here to Download

Data Structure and Algorithm (DSA)

Download Link: Click Here to Download

Anna University - Data structures and algorithms - APRIL/MAY 2010 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010

Third Semester

Electrical and Electronics Engineering

EE2204 — DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation Engineering and Instrumentation and

Control Engineering)

(Regulation 2008)

Time: Three hours Maximum: 100 Marks

Answer ALL Questions
PART A — (10 × 2 = 20 Marks)

1. List out the areas in which data structures are applied extensively.
2. Convert the expression ((A+B)*C-(D-E)^(F +G)) to equivalent Prefix and
Post fix notations.
3. How many different trees are possible with 10 nodes?
4. What is an almost complete binary tree?
5. In an AVL tree, at what condition the balancing is to be done?
6. What is the bucket size, when the overlapping and collision occur at same
time?
7. Define graph.
8. What is a minimum spanning tree?
9. Define NP hard and NP complete.
10. What is meant by dynamic programming?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) What is a linked list? Explain with suitable program segments any
four operations of a linked list. (Marks 12)
(ii) Explain with a pseudo code how a linear queue could be converted
into a circular queue. (Marks 4)
Or
(b) (i) What is a stack ADT? Write in detail about any three applications
of stack. (Marks 11)
(ii) With a pseudo code explain how a node can inserted at a user
specified position of a doubly linked list. (Marks 5)
12. (a) (i) Discuss the various representations of a binary tree in memory with
suitable example. (Marks 8)
(ii) What are the basic operations that can be performed on a binary
tree? Explain each of them in detail with suitable example. (Marks 8)
Or
(b) (i) Give an algorithm to convert a general tree to binary tree. (Marks 8)
(ii) With an example, explain the algorithms of in order and post order
traversals on a binary search tree. (Marks 8)
13. (a) What is an AVL tree? Explain the rotations of an AVL tree. (Marks 16)
Or
(b) (i) Explain the binary heap in detail. (Marks 8)
(ii) What is hashing? Explain any two methods to overcome collision
problem of hashing. (Marks 8)
14. (a) (i) Explain Dijkstra's algorithm and solve the single source shortest
path problem with an example. (Marks 12)
(ii) Illustrate with an example, the linked list representation of graph.
(Marks 4)
Or
(b) (i) Write the procedures to perform the BFS and DFS search of a
graph. (Marks 8)
(ii) Explain Prim's algorithm to construct a minimum spanning tree
from an undirected graph. (Marks 8)
15. (a) (i) With an example, explain how will you measure the efficiency of an
algorithm. (Marks 8)
(ii) Analyze the linear search algorithm with an example. (Marks 8)
Or
(b) Explain how the travelling salesman problem can be solved using greedy
algorithm. (Marks 16) 

Data Structure - Trees, Binary Trees and Binary Search Trees

Download Link: Click Here to Download

Data Structure - AVL Tree Part 2 - AVL Rotation

Download Link: Click Here to Download

Data Structure - AVL Tree - Part 1

Download Link:Click Here to Download

Data Structure - Abstract Data Type

Download Link : Click Here to Download

Data Structure and Algorithm - Lab Manual- Updated Edition 1.0 - 2011

Whats New ?

• Binary Search Tree Program and Output Replaced.
• Algorithm changed form some Programs.
• Known certain programs error Fixed.

Download : Click Here to Download

Data Structure and Algorithm Two Marks with solution (All Units)

Thanks to :
                   Mrs.N.Amsaveni
                   Dept of CSE
                  Shri Andal Alagar College of Engineering


Download : Click Here to Download

Data Structure and Algorithm - 100 Two marks with Answeres

Thanks to :
                  NOORUL ISLAM COLLEGE OF ENGINEERING
                  Kumaracoil,Thuckalay, Kanyakumari District, Tamilnadu State, India- 629 180.     
               
Download : Click Here to Download

Data Structure and Algorithm - Two Marks with Answer

Download : Click Here to Download

Data Structure and Algorithm Lab Updated Edition

Whats New ?

• Tree Traversal Program Output Added.
• BACKTRACKING ALGORITHM Program and Output Updated.
• DIJKSTRA'S ALGORITHM Program and Output Updated.
• PRIORITY QUEUE USING HEAPS Program and Output Updated.
• Minor Mistakes changed.

Download : Click Here to Download

DATA STRUCTURES AND ALGORITHMS DECEMBER 2009 Question Paper

	ANNA UNIVERSITY COIMBATORE
B.E./B.Tech. DEGREE EXAMINATION:DECEMBER 2009
	REGULATION-2008
	THIRD SEMESTER
   (COMMON TO EEE/EIE/ICE)
080300003-DATA STRUCTURES AND ALGORITHMS
Time : 3 hours            Maximum : 100 marks

	Answer ALL questions.

	PART A — (20 * 2 = 40 marks)

1. What are the advantage of modularity?
2. What are the two basic operation on array?
3. Give any two example for linked list
4. What is circularly linked list?
5. Differentiate LIFO and FIFO and give typical examples of it.
6. What is a tree?why it is used.
7. What is the need for non-linear data structure?
8. What are the operation on the binary tree?
9. What is the majar drawback of sepsrste chaining hashing?
10.What is a balance factor for any node in AVL tree?
11.What is heap?
12.What is linear probing?
13.Define the following:
   (i)Graph (ii)cycle
14.What is Biconnectivity?
15.Give any tow typical application of graphs.
16.where is Huffman coding is used?
17.What is principle of divide and conquer algorithms?
18.What do you mean by best fit in Bin packing?
19.What is the principle of randomized algorithms?
20.List out any two examples for NP complete problems.

PART B — (5 * 12 = 60 marks)

21.Explain the operation of a linked list.Also compara linked list and Array
22.Explain the various traversals in binary tree with example.
23.What is AVL tree? Also write suitable rotation algorithm.
24.Expain the shortest path algorithm with diagram.
25.Expain the kruskal's algorithm with diagram.
26.Expain the concept of stack and briefed on its two functions.
27.What is hashing?list out the various techniques of hashing.
28.Write short noteson folloeing:(i)B-tree(ii)Dynamic programming

Data Structure and Algorithm - Viva Questions

1. What is data structure?

A data structure is a way of organizing data that considers not only the items stored, but also their

relationship to each other. Advance knowledge about the relationship between data items allows

designing of efficient algorithms for the manipulation of data.

2. List out the areas in which data structures are applied extensively?

1. Compiler Design,

2. Operating System,

3. Database Management System,

4. Statistical analysis package,

5. Numerical Analysis,

6. Graphics,

7. Artificial Intelligence,

8. Simulation

3. What are the major data structures used in the following areas : RDBMS, Network data

model and Hierarchical data model.

1. RDBMS = Array (i.e. Array of structures)

2. Network data model = Graph

3. Hierarchical data model = Trees

4. If you are using C language to implement the heterogeneous linked list, what pointer

type will you use?

The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to

connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void

pointer is capable of storing pointer to any type as it is a generic pointer type.

5. Minimum number of queues needed to implement the priority queue?

Two. One queue is used for actual storing of data and another for storing priorities.

6. What is the data structures used to perform recursion?

Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to

return when the function has to return. Recursion makes use of system stack for storing the return

addresses of the function calls.

Every recursive function has its equivalent iterative (non-recursive) function. Even when such

equivalent iterative procedures are written, explicit stack is to be used.

7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and

postfix forms?

Polish and Reverse Polish notations.

8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix

notations.

1. Prefix Notation: ^ - * +ABC - DE + FG

2. Postfix Notation: AB + C * DE - - FG + ^

9. Sorting is not possible by using which of the following methods? (Insertion, Selection,

Exchange, Deletion)

Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection

we can perform selection sort, using exchange we can perform the bubble sort (and other similar

sorting methods). But no sorting method can be done just using deletion.

10. What are the methods available in storing sequential files ?

1. Straight merging,

2. Natural merging,

3. Polyphase sort,

4. Distribution of Initial runs.

11. List out few of the Application of tree data-structure?

1. The manipulation of Arithmetic expression,

2. Symbol Table construction,

3. Syntax analysis.

12. List out few of the applications that make use of Multilinked Structures?

1. Sparse matrix,

2. Index generation.

13. In tree construction which is the suitable efficient data structure? (Array, Linked list,

Stack, Queue)

Linked list is the suitable efficient data structure.

14. What is the type of the algorithm used in solving the 8 Queens problem?

Backtracking.

15. In an AVL tree, at what condition the balancing is to be done?

If the 'pivotal value' (or the 'Height factor') is greater than 1 or less than -1.

16. What is the bucket size, when the overlapping and collision occur at same time?

One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to

accommodate the colliding value. This results in the overlapping of values.

17. Classify the Hashing Functions based on the various methods by which the key value is

found.

1. Direct method,

2. Subtraction method,

3. Modulo-Division method,

4. Digit-Extraction method,

5. Mid-Square method,

6. Folding method,

7. Pseudo-random method.

18. What are the types of Collision Resolution Techniques and the methods used in each of

the type?

1. Open addressing (closed hashing), The methods used include: Overflow block.

2. Closed addressing (open hashing), The methods used include: Linked list, Binary tree.

19. In RDBMS, what is the efficient data structure used in the internal storage

representation?

B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching

easier. This corresponds to the records that shall be stored in leaf nodes.

 20. What is a spanning Tree?

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the

tree once. A minimum spanning tree is a spanning tree organized so that the total edge

weight between nodes is minimized.

 21. Does the minimum spanning tree of a graph give the shortest distance between

any 2 specified nodes?

The Minimal spanning tree assures that the total weight of the tree is kept at its minimum.

But it doesn't mean that the distance between any two nodes involved in the minimumspanning

tree is minimum.

22. Which is the simplest file stru

cture? (Sequential, Indexed, Random)

Sequential is the simplest file structure.

 23. Whether Linked List is linear or Non-linear data structure?

According to Access strategies Linked list is a linear one.

According to Storage Linked List is a Non-linear one.

Binary Search Tree Program with Output

Program : 

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
typedef struct bst
{
int data;
struct bst *left,*right;
}node;
void insert(node *,node *);
void inorder(node *);
node *search(node *,int,node **);
void del(node *,int);
void main()
{
int choice;
char ans='N';
int key;
node *New,*root,*tmp,*parent;
node *get_node();
root=NULL;
clrscr();
printf("\n \t Program for Binary Search Tree");
do
{
printf("\n1 Create \n2. Search \n3.Delete \n4.Display\n 5.Exit");
printf("\n Enter ur choice :");
scanf("%d",&choice);
switch(choice)
{
case 1:
do
{
New=get_node();
printf("\n Enter the element");
scanf("%d",&New->data);
if(root==NULL)
root=New;
else
insert(root,New);
printf("\n Do u want to enter moreelements?(Y/N)");
ans=getch();;
}while(ans=='Y');
break;
case 2:
printf("\n Enter the element which u want tosearch");
scanf("%d",&key);
tmp=search(root,key,&parent);
printf("\n Parent of the node %d is%d",tmp->data,parent->data);
break;
case 3:
printf("\n Enter the element u wish to delete");
scanf("%d",&key);
del(root,key);
break;
case 4:
if(root==NULL)
printf("Tree is not created");
else
{
printf("\n The Tree is :");
inorder(root);
}
break;
case 5:
exit(0);
}
}
while(choice!=5);
}
node *get_node()
{
node *temp;
temp=(node *)malloc(sizeof(node));
temp->left=NULL;
temp->right=NULL;
return temp;
}
void insert(node *root,node *New)
{
if(New->data<root->data)
{
if(root->left==NULL)
root->left=New;
else
insert(root->left,New);
}
if(New->data>root->data)
{
if(root->right==NULL)
root->right=New;
else
insert(root->right,New);
}
}
node *search(node *root,int key,node **parent)
{
node *temp;
temp=root;
while(temp!=NULL)
{
if(temp->data==key)
{
printf("\n %d Element is present",temp->data);
return temp;
}
*parent=temp;
if(temp->data>key)
temp=temp->left;
else
temp=temp->right;
}
return NULL;
}
void del(node *root,int key)
{
node *temp,*parent,*temp_succ;
temp=search(root,key,&parent);
if(temp->left!=NULL&&temp->right!=NULL)
{
parent=temp;
temp_succ=temp->right;
while(temp_succ->left!=NULL)
{
parent=temp_succ;
temp_succ=temp_succ->left;
}
temp->data=temp_succ->data;
parent->right=NULL;
printf("\n Now delete it!");
return;
}
if(temp->left!=NULL&&temp->right==NULL)
{
if(parent->left==temp)
parent->left=temp->left;
else
parent->right=temp->left;
temp=NULL;
free(temp);
printf("\n Now Delete it !");
return;
}
if(temp->left==NULL&&temp->right!=NULL)
{
if(parent->left==temp)
parent->left=temp->right;
else
parent->right=temp->right;
temp=NULL;
free(temp);
printf("\n Now Delete it !");
return;
}
if(temp->left==NULL&&temp->right==NULL)
{
if(parent->left==temp)
parent->left=NULL;
else
parent->right=NULL;
printf("\n Now Delete it !");
return;
}
}
void inorder(node *temp)
{
if(temp!=NULL)
{
inorder(temp->left);
printf("\n %d",temp->data);
inorder(temp->right);
}
}

Output : 

Output:
Program for BinarySearch Tree
1. Create
2.  Search
3. Delete
4. Display
5. Exit
Enter your choice: 1
Enter the Element: 100
Do you want to enter more element?(Y/N) : Y
Enter the Element: 200
Do you want to enter more element?(Y/N) : Y
Enter the Element: 300
Do you want to enter more element?(Y/N) : Y
Enter the Element: 400
Do you want to enter more element?(Y/N) : Y
Enter the Element: 500
Do you want to enter more element?(Y/N) : N
                                  Program for Binary
Search Tree
1. Create
2.  Search
3. Delete
4. Display
5. Exit
Enter your choice: 2
Enter the element you wish to search: 200
200 Element is present
Parent node of 200 is 100
Program for Binary
Search Tree
1. Create
2.  Search
3. Delete
4. Display
5. Exit
Enter your choice: 4
The Tree is
100
200
300
400
500
Program for Binary
Search Tree
1. Create
2.  Search
3. Delete
4. Display
5. Exit
Enter your choice: 3
Enter the element you wish to delete: 300
300 element is present!
Now Deleted!!
Program for Binary
Search Tree
1. Create
2.  Search
3. Delete
4. Display
5. Exit
Enter your choice: 4
The Tree is
100
200
400
500

Data Structure and Algorithm - Balanced Trees Lecture Notes

Download :  Click Here to Download

         Help :  How to Download ?