Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Misc7.7K+ articles

Mathematical5.1K+ articles

Amazon1.9K+ articles

Recursion591+ articles

DFS360+ articles

Binary Tree330+ articles

tree-level-order123+ articles

Tree Traversals106+ articles

Trees

61 posts

Preorder vs Inorder vs Postorder

Last Updated: 23 July 2025

InPreorder Traversal, the root node is visited first, followed by the left and right subtrees.Inorder Traversalstarts with the left subtree, visits the root, and then the ...read more

article_image

Inorder Traversal

Preorder Traversal

PostOrder Traversal

Find Edge Weights in a Spanning Tree with Edge (u, v)

Last Updated: 23 July 2025

Given an undirected weighted graph with N nodes and M edges, the task is for each edge (u, v) find the minimum possible weight of the Spanning Tree which contains the edge...read more

article_image

Kruskal'sAlgorithm

Geeks Premier League 2023

POTD Solutions | 17 Nov' 23 | Binary Tree to CDLL

Last Updated: 23 July 2025

View all POTD SolutionsWelcome to the daily solutions of our PROBLEM OF THE DAY (POTD). We will discuss the entire problem step-by-step and work towards developing an opti...read more

article_image

GFG-POTD-Solutions

Count Edge reversal in a Directed Graph

Last Updated: 31 December 2023

Given a directed graph with n nodes from 0 to n-1, a 2d array edges[][] where edges[i] = [ui, vi] represents a directed edge going from node ui to node vi . The graph woul...read more

article_image

Geeks Premier League

Geeks Premier League 2023

Collect Maximum Points from all Nodes

Last Updated: 23 July 2025

Given a tree of N nodes and N-1 edges rooted at Node 1, an array points[] of size N, where points[i] denote the number of points at the vertex i and an integer k. A Node c...read more

article_image

Algorithms-Dynamic Programming

Maximum prizes in a tree by placing M persons

Last Updated: 18 January 2024

Given n nodes with exactly n-1 edges and m persons (n =m). At each node, you can either place a person or unlimited prizes for persons. Each person would be moving towards...read more

Geeks Premier League

Geeks Premier League 2023

Last Updated: 26 August 2025

Binary Lifting is a Dynamic Programming approach for trees where we precompute some ancestors of every node. It is used to answer a large number of queries where in each q...read more

article_image

Competitive Programming

DP on Trees for Competitive Programming

Last Updated: 23 July 2025

Dynamic Programming (DP) on trees is a powerful algorithmic technique commonly used in competitive programming. It involves solving various tree-related problems by effici...read more

article_image

Competitive Programming

Algorithms-Dynamic Programming

Exploring Range Trees

Last Updated: 23 July 2025

While learning data structures we come across various types of data structures ranging from data structures like arrays to slightly difficult data structures like graphs a...read more

article_image

Data Structures

Maximal Point Path

Last Updated: 23 July 2025

Given a tree with N nodes numbered from 1 to N. Each Node has a value denoting the number of points you get when you visit that Node. Each edge has a length and as soon as...read more

article_image

Dynamic Programming

Algorithms-Dynamic Programming

Count the unique type of nodes present in Binary tree

Last Updated: 23 July 2025

According to the property of a Binary tree, a node can have at most two children so there are three cases where a node can have two children, one child, or no child, the t...read more

Find Mode in Binary Search tree

Last Updated: 22 March 2023

Given a Binary Search Tree, find the mode of the tree.Note: Mode is the value of the node which has the highest frequency in the binary search tree.Examples:Input: ...read more

Binary Search Tree

Step by step Shortest Path from source node to destination node in a Binary Tree

Last Updated: 23 July 2025

Given a root of binary tree and two integers startValue and destValue denoting the starting and ending node respectively. The task is to find the shortest path from the st...read more

Find path between lowest and highest value in a Binary tree

Last Updated: 31 October 2023

Given a binary tree consisting of N nodes. Find the path between the node having the lowest value to the node having the highest value. There is no restriction on the trav...read more

Find MEX of every subtree in given Tree

Last Updated: 23 July 2025

Given a Generic Tree consisting of N nodes numbered from 0 to N - 1 which is rooted at node 0 and an array val[] such that the value at each node is represented by val[i],...read more

Divide and Conquer