Scribd
Upload
14 views1 page

Ds Ka Material

The document discusses various data structures including graphs, threaded binary trees, AVL trees, Huffman coding, and binary search trees. It highlights the characteristics, advantages, and traversal methods of these structures, emphasizing the importance of relationships and arrangements of data. Additionally, it covers operations such as insertion, deletion, searching, and sorting within these data structures.

Uploaded by

Bhushan Chaudhar A11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
14 views1 page

Ds Ka Material

The document discusses various data structures including graphs, threaded binary trees, AVL trees, Huffman coding, and binary search trees. It highlights the characteristics, advantages, and traversal methods of these structures, emphasizing the importance of relationships and arrangements of data. Additionally, it covers operations such as insertion, deletion, searching, and sorting within these data structures.

Uploaded by

Bhushan Chaudhar A11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

What is graph..

Parameters LDS

Graph is a collection of set of vertices V where the actual data is Relation- every item is related to its previous and next item.

stored and set of edges E which connects those vertices Arrangement - Data is arranged in linear sequence.

Traversing- data items can be traversed in a single run.

implementation- implementation is easy.

Explain threaded binary tree in detail?.. examples- array,stack,queue,linked list..

In computing,a threaded binary tree is a binary tree variant that allows

fast traversal: given a pointer to a node in a threaded tree, it is NDS

possible to easily find its in order successor (and/or predecessor). A Relation- every item is attached with many other items.

binary tree is threaded by making all right child pointers that would Arrangement- data is not arranged in linear sequence.

normally be null point to the inorder successors of the node (if it Traversing- data item cannot be traversed In a single run.

exists) and all the left child pointers that would normally be null point Implementation- implementation is difficult

to the inorder predecessor of the node. It is also possible to discover ESam- tree ,graph

the parent of a node from a threaded binary tree without explicit use

of parent pointers or a stack. It is also useful where stack pace is

limited, or where a stack of parent pointers is unavailable.. Single Operation on Data structure

threaded and double threaded,,,,,, Insertion- insertion refers to addition of new data element in data

structure

Deletion- deletion refers to removal of a data element from a data

What is avl structure

Avl or height balanced tree is considered as a self balanced binary Searching- searching refers to finding the specified data element in a

search tree. The meaning is that an avl tree is also a binary search data structure..

tree but it is a balanced tree. A binary tree is considered as a Traversal- traversal of a data structure means visiting every element

Balanced, When the difference between the height of left and right of the data structure at least once.

sub trees of every node in the tree is in the range of -1, 0 or +1. In Sorting- arranging data elements of a data structure Ina standard

other words, we can say that a binary tree is set to be a balance if for predetermined sequence is called sorting.

every node,height of its children differ by at most one.. In an avl tree, Merging- combining elements of more than one data structure in third

every node maintains an extra information called as balance factor. data structure is called as merging..

avl by g.m. Adele’s on velsky and e.m. Landis in 1962..

Huffman coding

Huffman coding is a lossless data compression algorithm. The idea is

to assign variable length codes to input Characters, length of the

assigned codes are based on the frequencies of corresponding

characters. The most frequent character gets the smaller code and the

least frequency character gets the largest code. The variable-length

codes assigned to input characters are prefixed codes, means the

codes are assigned in such a way that the code assigned to one

character is not prefix of code assigned to any other character.This is

how Huffman coding makes such that there is no ambiguity when

decoding the denigrated bit steam..

Binary search tree

A binary search tree is which the data of all the nodes in the left sub

tree of the root node is less than the data of the root and the data of

all the nodes in the right sub tree of the root node is more than the

data of the root, is called binary,,,,, two types,,,,, left sub tree

(contains only smaller values),,, right sub tree (contains only larger

values)…

You might also like