Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
Unrooted binary tree in Data Structure
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 MoreTournament Trees, Winner Trees and Loser Trees in Data Structure
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 MorePrefix and Postfix Expressions in Data Structure
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 MoreCircular queues-Insertion and deletion operations in C++
A queue is an abstract data structure that contains a collection of elements. Queue implements the FIFO mechanism i.e the element that is inserted first is also deleted first.Queue cane be one linear data structure. But it may create some problem if we implement queue using array. Sometimes by using some consecutive insert and delete operation, the front and rear position will change. In that moment, it will look like the queue has no space to insert elements into it. Even if there are some free spaces, that will not be used due to some logical problems. To overcome this ...
Read MoreHow to count the number of words in a string in R?
The number of words in a sentence could be used for text analysis, therefore, we are required to count them. This can be for a single sentence or for multiple sentences. We can find the number of words in a sentence or in multiple sentences using strsplit with sapply.ExampleConsider the below sentences read as vectors −> x1 x1 [1] "Data Science is actually the Statistical analysis" > sapply(strsplit(x1, " "), length) [1] 7 > x2 x2 [1] "China faced trouble even after controlling COVID-19" > sapply(strsplit(x2, " "), length) [1] 7 > x3 x3 [1] "Corona virus has changed everything ...
Read MoreR-trees in Data Structure
Here we will see the R-Trees data structure. The R-Trees are used to store special data indexes in an efficient manner. This structure is very useful to hold special data queries and storages. This R-trees has some real life applications. These are like below −Indexing multidimensional informationHandling game dataHold geospatial coordinatesImplementation of virtual mapsOne example of R-Tree is like below.Corresponding R-tree is like below −Properties of R-TreesR-Trees are made of with single root, internal and leaf nodesThe root has a pointer to the largest region in the special domainThe parent nodes will hold child nodes where child nodes completely overlap ...
Read MoreHow to change plot area margins using ggplot2 in R?
While creating plots using ggplot2, the plot area is of square shape but we can change our plot area by setting plot.margin in theme function. This is helpful when we want to decrease the plot area and also when the data points are less.ExampleConsider the below data frame −> set.seed(1) > x y df library(ggplot2)Creating the scatterplot without changing the plot area margins −> ggplot(df,aes(x,y))+ + geom_point()> ggplot(df,aes(x,y))+ + geom_point()+ + theme(plot.margin = unit(c(1,1,1,1), "cm"))> ggplot(df,aes(x,y))+ + geom_point()+ + theme(plot.margin = unit(c(2,2,2,2), "cm"))
Read MoreMerge Algorithms in Data Structure
The Merge algorithm is used to merge two sorted list into one list. This algorithm is used in different cases. If we want to perform merge sort, then we need to merge the sorter lists into larger lists.The approach is simple. We take two lists, there will be two pointers. The first one will point to the element of the fist list, second one will point to the elements of the second list. Based on their values, the smaller element is taken from one of these two lists, then increase the pointer of that corresponding list. This operation will be ...
Read MoreHow to select multiple elements of a list in R?
Generally, a list in R contains a large number of elements and each element can be of different type which is a great thing about lists. Since we can store type of data as a list element therefore storage and selection to different type of data becomes easier. And we can also select single or multiple elements of the list at a time. This can be done with the help of single square brackets.ExampleConsider the below list −> list_data list_data [[1]] [1] "India" [[2]] [1] "China" [[3]] [1] 21 32 11 [[4]] [1] "a" "b" "c" "d" "e" [[5]] ...
Read MoreBinary Trees as Dictionaries in Data Structure
When we try to implement abstract data type Dictionary, then the node associates with values. A dictionary is basically a set of keys, which must be elements drawn from a total ordering. There may be additional information, which are associated with each key, but it does not lead to any conceptual comprehension.If the dictionary is implemented using trees, then each node will hold unique keys. Here for each node u in the tree, every key is u.l is strictly smaller than u.k. And every key in u.r, is strictly larger than u.k. A tree is organized according to this invariant ...
Read More