Found 218 Articles for Analysis of Algorithms

Melding Two Max HBLTs in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 07:10:20
The meld strategy is done easily using recursion. Suppose A and B are two HBLTs, that will be melded. If one of them is empty, then simply make another one as final result. If no empty HBLT is there, then we have to compare the elements in the two roots. The root with larger element becomes the root of melded HBLT.Suppose A has larger root. And that is its left subtree is L. Suppose C be the max HBLT, that results from melding the right subtree of A and the HBLT B. The final HBLT will have A as root, ... Read More

Deletion of Max Element from a Max HBLT In Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 07:07:28
In Max HBLT, the root is placed at the root. If the root is deleted, then two max HBLTs, i.e. left and right will be separated. By melding together these two Max HBLT again, we can merge them into one. So after melding all elements will be there, except the deleted one.

Insertion Into a Max HBLT in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 07:06:16
The insertion into Max HBLT, can be done using Max Meld operation. This operation is used to merge two Max HBLT into one Max HBLT. Suppose, we want to insert x into one max HBLT, called H. We will create a small HBLT using x, then meld this with H, then after melding, H will hold all elements including x. So melding operation is needed to perform the insertion operations for HBLT.

Height-Biased Leftist Trees in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 07:04:42
Here we will see what is the Height Balanced Leftist Trees (HBLT). Consider a binary tree where a special node, called an external node replaces each empty subtree. All other nodes are called Internal Nodes. When some external nodes are added with some binary tree, then that is called an extended binary tree.If we do not consider the leaf edges of this tree, then that is the actual binary tree. and this is the extended binary tree.Now suppose s(x) be the length of a shortest path from node x to an external node in its subtree. If x is an ... Read More

Acyclic digraphs in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 07:02:46
Here we will see the what is the Acyclic digraphs. The acyclic digraphs are directed graphs containing no directed cycles. The Directed Acyclic Graphs are abbreviated as DAG.Every finite DAG has at-least one node whose out-degree is 0.Example of DAG with one node −Example of DAG with two nodes −Example of DAG with three nodes −

k-ary tree in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 06:46:48
In this section we will see what is the K-ary tree. The K-ary tree is a rooted tree, where each node can hold at most k number of children.If the value of k is 2, then this is known as binary tree. The binary tree, or ternary trees are some specialized k-ary trees. So k-ary trees re generalized.Example of K-ary Tree −In the above example, there is a root. The root has four children. Each child of root has some children also. The first child has three children, the second child has no child, the third one has two children, ... Read More

Rooted vs Unrooted Trees in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 06:45:02
In this section we will see what are the differences between rooted and the unrooted trees. At first we will see some examples of Rooted, and Unrooted trees.Example of Rooted Tree −Example of Unrooted Tree −Basic Differences between rooted and Unrooted treesIn a rooted tree, each node with descendants represents the inferred most recent common ancestors of the descendants. In some trees, the edge lengths may be interpreted as time estimates.For the unrooted trees, there is no ancestral root. Unrooted trees represent the branching order, but do not indicate the root of the location of the last common ancestor.Read More

Unrooted binary tree in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 06:42:48
Here we will see the what is the unrooted binary tree. These trees are connected undirected graph with no cycle. The vertices with one neighbor are the leaves of the tree. Remaining vertices are internal nodes. The degree of the vertices is its number of neighbors. In a tree with more than one node, the leaves are the vertices of degree one.Free tree is one type of binary tree, where all internal nodes have exactly degree three. In Computer Science, binary trees are often rooted, and ordered, when they are used as data structures, but the applications of unrooted binary ... Read More

Tournament Trees, Winner Trees and Loser Trees in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 06:40:54
Here we will see the Tournament trees, Winner and Looser trees. The Tournament tree is a complete binary tree with n external nodes and n – 1 internal nodes. The external nodes represent the players, and the internal nodes are representing the winner of the match between the two players. This tree is also known as Selection tree.There are some properties of Tournament trees. These are like below −This tree is rooted. So the link in the tree and directed path from parent to children, and there is a unique element with no parentsThe parent value is less or equal ... Read More

Prefix and Postfix Expressions in Data Structure

Arnab Chakraborty
Updated on 11-Aug-2020 06:38:14
The way to write arithmetic expression is known as a notation. An arithmetic expression can be written in three different but equivalent notations, i.e., without changing the essence or output of an expression. These notations are –InfixPrefixPostfixInfix notations are normal notations, that are used by us while write different mathematical expressions. The Prefix and Postfix notations are quite different.Prefix NotationIn this notation, operator is prefixed to operands, i.e. operator is written ahead of operands. For example, +ab. This is equivalent to its infix notation a + b. Prefix notation is also known as Polish Notation.Postfix NotationThis notation style is known ... Read More
Advertisements