Algorithms Finding Diameter of Tree using Height of each Node We have explored the algorithm on how to find the diameter of the tree using height of each node. This will take linear time O(V+E) time complexity.

Algorithms Finding Diameter of a Tree using DFS In this article, we will be discussing how to find the diameter of a tree or graph using Depth First Search (DFS).

Algorithms Algorithm to find Level of each node from root node In this article we will be discussing on how to find the level of each node in a graph, the algorithm that we will be using to find the level of each node is breadth first search.

Software Engineering priority_queue::push() in C++ Push function in priority queue is used to to insert a element in the queue, the element is inserted in the priority queue based on it's value which defines it's priority in the queue.

Software Engineering Different Ways to Initialize Priority queue in C++ We have demonstrated different Ways to Initialize Priority queue in C++ such as using Max Heap, Min Heap and with vector and array.