## 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 »

- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Reverse zigzag Traversal of a Binary Tree
- Reverse Level Order traversal in spiral form
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Iterative Postorder traversal | Set 3
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- LCA in a tree using Binary Lifting Technique
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Sum of all the Boundary Nodes of a Binary Tree
- Print all leaf nodes of a binary tree from right to left
- Sum of nodes in bottom view of Binary Tree
- Check if two nodes in a Binary Tree are siblings
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Distribute candies in a Binary Tree
- Create a mirror tree from the given binary tree
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- K-th ancestor of a node in Binary Tree | Set 3
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Minimum sum path between two leaves of a binary tree
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Print leaf nodes in binary tree from left to right using one stack
- Print the first shortest root to leaf path in a Binary Tree
- Iterative approach to check for children sum property in a Binary Tree
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree

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 »

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 »

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 »

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 »

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 »

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

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that weight[i]… Read More »

Given a Binary Tree, where each node contains an extra empty pointer initially null. The task is to connect all nodes of the binary tree… Read More »

Given a binary tree containing n nodes. The task is to find the sum of all the leaf nodes present at maximum level. Examples: Input:… Read More »

Given a binary tree, the task is to find the maximum length of the cycle that can be formed by joining any two nodes of… Read More »

Given a binary tree and an integer k, the task is to print the kth node in the vertical order traversal of binary tree.If no… Read More »

Given a binary tree, the task is to find the Lowest Common Ancestor of the given two nodes in the tree. Let G be a… Read More »

Given a Binary Tree, the task is to check whether the given Binary Tree is a perfect Binary Tree or not. A Binary tree is… Read More »

Given a binary tree and a value K. The task is to print the k-th node in the diagonal traversal of the binary tree. If… Read More »

Given a binary tree, the task is to print all the leaf nodes of the binary tree from right to left. Examples: Input : 1… Read More »