Data Structures & Algorithm

All Q&A

What is a minimum spanning tree ? Describe Huffman’s Algorithm.

22 December, 2024

A spanning tree of a graph is just a subgraph that contains all the vertices and is a tree. Huffman’s algorithm is a method for building an extended binary tree with a minimum weighted path length from a set of given weights.

What are the differences between AVL Tree & Binary Search Tree ?

22 December, 2024

A binary search tree (BST) is a binary tree data structure which has the following properties: ->each node has a value;

Find the time complexity of Binary Search Algorithm.

22 December, 2024

In binary search each step of the algorithm divides the list of items being searched in half of the list. So we can say that

Construct an AVL tree using the below list. Show all the steps 12, 11, 13, 10, 09, 15, 14, 18, 7, 6, 5.

22 December, 2024

Steps of creating AVL tree using the list

What is a priority queue ?

22 December, 2024

Priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it.

Write the recursive algorithm to find x^ n.

22 December, 2024

float power(float x, int n) { if(x=0)

Find the postfix notation of

( a + b * x) / ( a ! – d ) s – c * y ( show all steps ).

22 December, 2024

Infix to Postfix conversion

Subjects

C Programming and Practices Mobile computing Design and Analysis of Algorithm Computer Graphics and Multimedia Compiler Design Software Engineering

Browse Streams