## Sum of the mirror image nodes of a complete binary tree in an inorder way

Given a complete binary tree, the task is to find the sum of mirror image nodes in an inorder way i.e. find the inorder traversal… Read More »

## K-th ancestor of a node in Binary Tree | Set 3

Given a binary tree in which nodes are numbered from 1 to N. Given a node and a positive integer K. We have to print… Read More »

## B-Tree Insert without aggressive splitting

B-Tree Insert without aggressive splitting This algorithm for insertion takes an entry, finds the leaf node where it belongs, and inserts it there. We recursively… Read More »

## Find the largest Complete Subtree in a given Binary Tree

Given a Binary Tree, the task is to find the size of largest Complete sub-tree in the given Binary Tree. Complete Binary Tree – A… Read More »

## Index of kth set bit in a binary array with update queries

Given a binary array arr[] and q queries of following types: k: find the index of the kth set bit i.e. kth 1 in the… Read More »

## Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2

Given Preorder, Inorder and Postorder traversals of some tree. The task is to check if they all are of the same tree. Examples: Input :… Read More »

## Iterative Postorder traversal | Set 3

We have seen different ways of performing postorder traversal on Binary Trees. Post Order Traversal. Iterative Postorder Traversal using Two Stacks. Iterative Postorder Traversal using… Read More »

## Find the largest Perfect Subtree in a given Binary Tree

Given a Binary Tree, the task is to find the size of largest Perfect sub-tree in the given Binary Tree. Perfect Binary Tree – A… Read More »

## XOR of all the nodes in the sub-tree of the given node

Given an n-ary tree and Q queries where each query consists of an integer u which denotes a node. The task is to print the… Read More »

## Find all the pairs with given sum in a BST | Set 2

Given a Binary Search Tree and an integer sum, the task is to find all the pairs from the tree whose sum is equal to… Read More »

## Get last node of the binary tree following given pattern starting from X

Given a binary tree, target node X and a string patt. The task is to find the last node of the binary tree following the… Read More »

## Difference between sums of odd position and even position nodes for each level of a Binary Tree

Given a Binary Tree, the task is to find the absolute difference between the sums of odd and even positioned nodes. A node is said… Read More »

## Sum of all parent-child differences in a Binary Tree

Given a binary tree, find the sum of all parent-child differences for all the non-leaf nodes of the given binary tree. Note that parent-child difference… Read More »

## Print even positioned nodes of even levels in level order of the given binary tree

Given a binary tree, print even positioned nodes of even level in level order traversal. The root is considered at level 0, and the left… Read More »

## Maximum sum of non-leaf nodes among all levels of the given binary tree

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of non-leaf nodes among all level of given… Read More »