Trees

61 posts

Binary Lifting Guide for Competitive Programming

Last Updated: 10 March 2024

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

Trees

Competitive Programming

LCA

DSA

DP on Trees for Competitive Programming

Last Updated: 31 December 2023

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

Trees

Competitive Programming

Algorithms-Dynamic Programming

DSA

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 sear ...read more

Similar Topics

DSA

21.8k+ articles

Competitive Programming

2.2k+ articles

Algorithms

1.9k+ articles

Tree

1.3k+ articles

Recursion

1k+ articles

Graph

900+ articles

Advanced Data Structure

580+ articles

DFS

340+ articles

Binary Tree

310+ articles

tree-traversal

88+ articles

Compress a Binary Tree into an integer diagonally

Last Updated: 01 February 2023

Given a Binary Tree consisting of N nodes, the task is to first compress the tree diagonally to get a list of integers and then, again compr...read more

Queries to calculate Bitwise OR of each subtree of a given node in an N-ary Tree

Last Updated: 22 June 2021

Given an N-ary Tree consisting of N nodes valued from 1 to N, an array arr[] consisting of N positive integers, where arr[i] is the value as...read more

Competitive Programming

Count nodes from all lower levels smaller than minimum valued node of current level for every level in a Binary Tree

Last Updated: 29 March 2023

Given a Binary Tree, the task is for each level is to print the total number of nodes from all lower levels which are less than or equal to ...read more

Competitive Programming

Length of longest straight path from a given Binary Tree

Last Updated: 28 December 2023

Given a Binary Tree, the task is to find the length of the longest straight path of the given binary tree.Straight Path is defined as the pa...read more

Competitive Programming

Sum of Nodes and respective Neighbors on the path from root to a vertex V

Last Updated: 23 September 2021

Given a rooted tree having N vertices, an array values[ ], which represents the value assigned to each node, and a vertex V, the task is to ...read more

Count nodes in the given tree whose weight is a fibonacci number

Last Updated: 23 June 2021

Given a tree with the weights of all the nodes, the task is to count the number of nodes whose weight is a Fibonacci number.Examples:Input:O...read more

Count the nodes of the tree which make a pangram when concatenated with the sub-tree nodes

Last Updated: 08 June 2021

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weighted string when concatena...read more

Count the nodes in the given tree whose weight is even parity

Last Updated: 28 February 2023

Given a tree and the weights of all the nodes, the task is to count the number of nodes whose weights are even parity i.e. whether the count...read more

Count the nodes in the given tree whose weight is a power of two

Last Updated: 11 June 2021

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a power of 2.Examples:Input:Output:...read more

Count the nodes in the given tree whose weight is even

Last Updated: 27 April 2023

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is even.Examples:Input:Output: 3Only t...read more

Find the Kth node in the DFS traversal of a given subtree in a Tree

Last Updated: 27 January 2022

Given a tree with N nodes, and two integers K and V. The task is to find the Kth node in the DFS traversal of the vertex V.Consider the belo...read more

Convert a Binary Tree such that every node stores the sum of all nodes in its right subtree

Last Updated: 22 August 2022

Given a binary tree, change the value in each node to sum of all the values in the nodes in the right subtree including its own.Examples:Inp ...read more

1 2 3 4 5 >>

1 2 3 4 5 >>

1 2 3 4 >>