## Find maximum among all right nodes in Binary Tree

Given a Binary Tree. The task is to find the maximum value among all of the right child nodes of the Binary Tree. Note: If… Read More »

- Sum of cousins of a given node in a Binary Tree
- Flatten a binary tree into linked list
- Print nodes in top view of Binary Tree | Set 2
- Find n-th node in Postorder traversal of a Binary Tree
- Print the nodes of binary tree as they become the leaf node
- Print cousins of a given node in Binary Tree | Single Traversal
- Check if two nodes are cousins in a Binary Tree | Set-2
- Amazon On-Campus - 6 months Internship (SDE)
- Find the maximum node at a given level in a binary tree
- Sort the path from root to a given node in a Binary Tree
- Check if a binary tree is sorted level-wise or not
- Check if two trees have same structure
- Lowest Common Ancestor in Parent Array Representation
- Check whether a given binary tree is skewed binary tree or not?
- Shortest distance between two nodes in an infinite binary tree
- Introduction to Merkle Tree
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
- Print the number of set bits in each node of a Binary Tree
- Print path between any two nodes in a Binary Tree
- Count all pairs of adjacent nodes whose XOR is an odd number
- Check if two trees are mirror of each other using level order traversal
- Count pairs in a binary tree whose sum is equal to a given value x
- Search a node in Binary Tree
- Remove edges connected to a node such that the three given nodes are in different trees
- Sum of nodes at maximum depth of a Binary Tree | Iterative Approach
- Memory representation of Binomial Heap
- Find maximum among all right nodes in Binary Tree
- Level Order Successor of a node in Binary Tree
- Sum of all odd nodes in the path connecting two given nodes
- Some Basic Theorems on Trees

Given a Binary Tree. The task is to find the maximum value among all of the right child nodes of the Binary Tree. Note: If… Read More »

Merkle tree also known as hash tree is a data structure used for data verification and synchronization. It is a tree data structure where each… Read More »

Given a Binary Tree, the task is to find the Coefficient of Range in it. Range is defined as the difference between the maximum and… Read More »

Given a binary tree and a node in the binary tree, find Levelorder successor of the given node. That is, the node that appears after… Read More »

Given a binary tree and a node in the binary tree, find Levelorder Predecessor of the given node. That is, the node that appears before… Read More »

Given a binary tree. First print all leaf nodes, after that remove all the leaf nodes from the tree and now print all the new… Read More »

Given a binary tree and two nodes of that binary tree. Find the sum of all nodes with odd values in the path connecting the… Read More »

Given a Binary Tree of distinct nodes and a pair of nodes. The task is to find and print the path between the two given… Read More »

Given a Binary Tree with distinct nodes. Given two nodes node1 and node2, check if the two nodes lies in the same subtree of the… Read More »

Given a binary tree with distinct nodes and a pair of two nodes. The task is to find the XOR of all of the nodes… Read More »

Given a Binary Node and a node. The task is to search and check if the given node exits in the binary tree or not.… Read More »

Given a Binary Tree check whether it is skewed binary tree or not. A skewed tree is a tree where each node has only one… Read More »

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of… Read More »

Prerequisites: Binomial Heap Binomial trees are multi-way trees typically stored in the left-child, right-sibling representation, and each node stores its degree. Binomial heaps are collection… Read More »

Given a Binary tree. The task is to find and print the product and sum of all internal nodes (non-leaf nodes) in the tree. In… Read More »