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
Data Structure Articles
Page 65 of 164
Print all Nodes Except Rightmost Node of Every Level of the Binary Tree
In this problem, we will print all the nodes of the binary tree except the rightmost node of each level. We will use the level order traversal to traverse the binary tree, and we won’t print the last node of each level, which is the rightmost node. Problem statement − We have given a binary tree containing different nodes. We need to print all nodes of the binary tree except right most node. Sample examples Input 7 / \ ...
Read MoreMinimize the Maximum difference between Adjacent Elements in an Array
In this problem, we will minimize the maximum difference between adjacent elements by removing any M elements from the array. The naïve approach to solving the problem is to pick total N − M array elements and check which set contains the minimum or maximum adjacent difference. The optimized approach uses the queue data structure to solve the problem. Problem statement : We have given an sorted array of numbers in sorted order. We have also given M. We need to remove M elements from the array such that we can minimize the maximum difference between the adjacent array ...
Read MoreIterative Method to Find Height of Binary Tree
The binary tree is a data structure. Each node of the binary tree contains either 0, 1, or 2 nodes. So, the binary tree can contain multiple levels. Here, we need to write the iterative code using the loops to find the height of the binary tree. The total number of levels in the binary tree represents the height of the binary tree. Alternatively, we can say that the maximum depth of the binary tree from the root node is the height of the binary tree. Problem statement − We have given a binary tree. We need to ...
Read MoreHow to Efficiently Implement k Queues in a Single Array?
In some cases, we need to implement our own data structure for better usability and customization. Here, we need to implement the K Queues using the single array. The first solution that comes to mind is dividing the array into N/K parts and using each part of the array as a queue. Here, N is the array length. The problem with this solution is that we can’t utilize the array's space properly. If the array is not full, but any Mth queue indexes are full, we can’t insert an element to the Mth queue. So, we need an optimized approach. ...
Read MorePrint the node with the maximum degree in the prufer sequence
The node with the greatest degree within the Prufer grouping is the one that appears most often within the grouping. To discover it, we emphasise it through grouping and keep track of the frequencies of each hub. Once we have the frequencies, we select the hub with the most noteworthy recurrence as the hub with the maximum degree. This hub speaks to the leaf within the labelled tree. The Prufer grouping may be a one-of-a-kind representation of a labelled tree, where the maximum degree hub compares to the leaf that's included final amid the development preparation. By distinguishing this hub, ...
Read MorePrint the degree of every node from the given Prufer sequence
To print the degree of each hub from a given Prufer arrangement, ready to emphasise through the arrangement and tally the events of each node. By following the recurrence of each node, we will determine the degree of that hub within the corresponding labelled tree. This data gives insights into the network and structure of the tree. By printing the degree of each hub, you are ready to analyse the conveyance and distinguish imperative hubs. This examination makes a difference in understanding the properties and characteristics of the initial tree based on the Prufer arrangement representation. Methods Used Frequency ...
Read MoreNumber of trees whose sum of degrees of all the vertices is L
The number of trees with a given whole number of degrees, L, can be decided by an equation based on the chart hypothesis. To begin with, we note that the whole number of degrees in a tree with N vertices is continuously 2N-2. Utilising this, we are able to calculate the number of clears out within the tree, which is L minus 2. Another way is to determine the number of inner vertices by subtracting the number of takeoffs from the overall number of vertices. At long last, we were able to discover the number of ways to disseminate the ...
Read MoreMaximum number of nodes which can be reached from each node in a graph
In a graph, the most extreme number of hubs that can be reached from each hub depends on the structure and network of the chart. This value is determined by the number of active edges on each hub. In an undirected chart, each hub can reach all the hubs associated with it specifically, with the most extreme number of reachable hubs rising to the number of adjoining hubs. In a coordinated chart, the most extreme number of reachable hubs may shift for each hub, depending on the outdegree of each hub. The most noteworthy conceivable number of reachable hubs from ...
Read MoreFind two disjoint good sets of vertices in a given graph
This article explains the perplexing process of finding two totally partitioned sets of vertices inside a given chart using a convoluted calculation. The substance of the calculation lies within the idea of chart colouring, wherein colours are efficiently relegated to vertices, guaranteeing that no adjoining vertices share the same colour. By taking this overly complex approach, the calculation shrewdly builds two dissimilar sets of vertices, each comprising vertices bearing particular colours. The paramount objective is to set up a clear boundary between these sets, rendering them void of any interconnection edges. The technique utilised encompasses a combination of strenuous methods, ...
Read MoreFind K vertices in the graph which are connected to at least one of remaining vertices
Finding K vertices in the network that are connected to at least one of the remaining vertices may be done using DFS (Depth-First Search). Your beginning point should be one of the remaining vertices, and you should then perform a DFS on that vertex. Each vertex you come across while conducting the search will be noted, and it will be added to the group of similar vertices. Once K vertices have been located or all remaining vertices have been searched, keep repeating this. DFS aids in completing the assignment by carefully exploring the graph to find the K vertices that ...
Read More