Moderator: Renu Banswani

gravatar for Renu Banswani
Reputation:
10
Status:
Trusted
Location:
kalyan
Last seen:
20 minutes ago
Joined:
2 months ago
Email:
r***********@gmail.com

Academic profile

None
None
None
None

Posts by Renu Banswani

<prev • 472 results • page 1 of 48 • next >
0
votes
0
answers
3
views
0
answers
Singly linked list.
... - It is a data structure which is collection of elements in a chain function. - In a linked list, there will be a node which will consist of a data and a pointer which will be pointing to the next node. ![enter image description here][1] **Program:** # include < stdio.h> # include < co ...
renu written 1 hour ago by Renu Banswani10
0
votes
0
answers
2
views
0
answers
Program to evaluate postfix expression using STACK ADT.
... - Every character of the post-fix expression is scanned from left to right. - If the character encountered is an operand it is pushed onto the stack. - However, if an operator is encountered, then the top two values are popped from the stack and the operator is applied on these values. - The resu ...
renu written 1 hour ago by Renu Banswani10
0
votes
0
answers
5
views
0
answers
Queue ADT using linked list.
... - A queue has two basic operations: Insert and delete, the insert operation adds an element to the end of the queue and the delete operation removes the element from the front or the start of the queue. ![enter image description here][1] Fig, Linked Queue. Program: # include < stdio.h> # ...
renu written 2 hours ago by Renu Banswani10
0
votes
0
answers
4
views
0
answers
Program in 'c' to implement merge sort.
... Merge sort is a sorting algorithm that uses the divide, conquer and combine algorithm paradigm. **A] Divide:** It means partitioning the n-element array to be sorted into two sub arrays of n/2 elements in each sub-array. **B] conquer:** It means sorting the two arrays recursively using merge sort. ...
renu written 2 hours ago by Renu Banswani10
0
votes
0
answers
6
views
0
answers
Double ended queue.
... - A dequeue (Double ended queue) is a list in which the elements can be inserted or deleted at either end. - It is also known as a head tail linked list, because elements can be added to or removed from either in front (head) or the back (tail) end. - However, no element can be added and deleted f ...
renu written 7 hours ago by Renu Banswani10
0
votes
0
answers
6
views
0
answers
Huffman encoding and algorithm with example
... - Huffman encoding is an entropy encoding algorithm developed by David A Huffman that is widely used as lossless data comparison technique. - The Huffman coding algorithm uses a variable-length code table to encode a source character, where the variable-length code table is derived in a particular ...
renu written 7 hours ago by Renu Banswani10
0
votes
0
answers
7
views
0
answers
Splay tree and Trie
... - A splay tree is a self balancing binary search tree with an additional property that recently accessed elements can be re-accessed fast. - It is said to be an efficient binary tree because it performs basic operations such as insertion, search and deletion operations in o (log n) amortized time. ...
renu written 8 hours ago by Renu Banswani10
0
votes
0
answers
9
views
0
answers
Advantages of linked list over arrays.
... - An array is a linear collection of data elements and a linked list is a linear collection of nodes. - But unlike an array, a linked list does not share its nodes in consecutive memory locations. - Another point of difference between an array and a linked list is that a linked list does not allow ...
renu written 8 hours ago by Renu Banswani10
0
votes
0
answers
6
views
0
answers
Different types of tree traversal techniques.
... - Traversing a binary tree is a process of visiting each node in the tree exactly once in a symmetric way. - Unlike linear data structures in which the elements are traversed sequentially, tree is a non linear data structure in which the elements can be traversed in many different ways. There are ...
renu written 9 hours ago by Renu Banswani10
0
votes
0
answers
5
views
0
answers
Recursive functions of traversal techniques.
... Recursive functions of traversal techniques: **1. Pre-order traversal:** void Pre-order traversal ( start node * tree) < if (tree ! = NULL) < print f ("%\t" , tree $\rightarrow$ data); Pre-order traversal (tree $\rightarrow$ left); Pre-order traversal (tree $\rightarrow$ right); 3 3 ...
renu written 9 hours ago by Renu Banswani10

Latest awards to Renu Banswani

Centurion 21 days ago, created 100 posts.
Rising Star 8 weeks ago, created 50 posts within first three months of joining.