LOADING

Define data structure. Briefly explain linear and non linear data structures with their applications.

Convert A+(B*C-(D/E^F)*G) infix expression into postfix format showing stack status after every step in tabular form.

Create a Binary Search Tree for the following data and do in-order,Preorder and Post-order traversal of the tree.

40, 60, 15, 4, 30, 70, 65, 10, 95, 25, 34

With figure, explain the following terms: (1) Depth of a tree (2) Sibling nodes (3)Strictly binary tree (4) Ancestor nodes (5) Graph (6) Minimum spanning tree (7)Degree of a vertex.

Define the following terms.1) Graph 2)Tree3)Multi graph4) Weighted graph5)Elementary path6)Complete Binary tree7)Descendent node

What is Binary Search Tree? Write recursive algorithm/program to implement

in-order traversal of the Binary Search Tree.

Define the following with example :

Strictly binary tree

Complete binary tree

Generate a binary search tree for following numbers and perform in-order andpost-order traversals: 50, 40, 80, 20, 0, 30, 10, 90, 60, 70

List out different traversal way of tree and demonstrate any two with example.

Define Directed graph, spanning tree and minimum spanning tree.

Find minimum spanning tree for the graph shown in Figure 1.

Define height balanced tree. Construct a height balanced binary tree (AVL tree)

for the following data

32,16,44,52,78,40,12,22,02,23.

Explain Right-in-threaded, left- in - threaded and full -in-threaded binary trees.

Write Kruskal’s algorithm for minimum spanning tree and explain with an example.

Show how graph can be represented using example?How path matrix can be found out using adjacency matrix