## XOR of path between any two nodes in a Binary Tree

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 »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Iterative Postorder traversal | Set 3
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- K-th ancestor of a node in Binary Tree | Set 3
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Flatten Binary Tree in order of Level Order Traversal
- Find the largest Complete Subtree in a given Binary Tree
- Count all k-sum paths in a Binary Tree
- Check if the given n-ary tree is a binary tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Find the largest Perfect Subtree in a given Binary Tree
- Get last node of the binary tree following given pattern starting from X
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Print all the nodes except the leftmost node in every level of the given binary tree
- Maximum sum of leaf nodes among all levels of the given binary tree
- Sum of nodes in the left view of the given binary tree
- Print even positioned nodes of even levels in level order of the given binary tree
- Convert ternary expression to Binary Tree using Stack
- Flatten binary tree in order of post-order traversal
- Find the node whose xor with x gives minimum value
- Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
- Duplicate subtree in Binary Tree | SET 2
- Find the color of given node in an infinite binary tree
- Maximum sum of non-leaf nodes among all levels of the given binary tree
- Find Maximum Level Sum in Binary Tree using Recursion
- Sum of nodes in the right view of the given binary tree
- Maximum XOR with given value in the path from root to given node in the tree
- Number of ways to divide a Binary tree into two halves
- Flatten Binary Tree in order of Zig Zag traversal
- Delete the last leaf node in a Binary Tree

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 »

Given a Binary Tree. The task is to print the number of set bits in each of the nodes in the Binary Tree. Recommended: Please… Read More »

Given a Binary tree, the task is to sort the particular path from to a given node of the binary tree. You are given a… Read More »

Given a Binary Tree as shown below. The task is to count all pair of adjacent nodes whose XOR is an odd number. Explanation: Initially,… Read More »

Given a binary tree containing n distinct numbers and a value x. The problem is to count pairs in the given binary tree whose sum… Read More »

Given a Binary Tree and a Level. The task is to find the node with the maximum value at that given level. Recommended: Please try… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Given a binary tree represented as parent array, find Lowest Common Ancestor between two nodes ‘m’ and ‘n’. In the above diagram, LCA of 10… Read More »

Given two binary trees. The task is to write a program to check if the two trees are identical in structure. In the above figure… Read More »

Given a Binary Tree, find the maximum sum in a binary tree by adding the parent with its children. Exactly three Node needs to be… Read More »