## Count nodes with two children at level L in a Binary Tree

Given a Binary tree, the task is to count the number of nodes with two children at a given level L. Examples: Input: 1 /… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Kth smallest element in a subarray
- Introduction to Data Structures | 10 most commonly used Data Structures
- Iterative Postorder traversal | Set 3
- Total number of possible Binary Search Trees using Catalan Number
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Adobe Interview Experience ( 3 Years Exp )
- Find the node with maximum value in a Binary Search Tree using recursion
- Burn the binary tree starting from the target node
- K-th ancestor of a node in Binary Tree | Set 3
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Check which player visits more number of Nodes
- Pair with a given sum in BST | Set 2
- Find the node with minimum value in a Binary Search Tree using recursion
- Construct BST from its given level order traversal | Set-2
- Minimum steps to color the tree with given colors
- Print Bottom-Right View of a Binary Tree
- Number of pairs with a given sum in a Binary Search Tree
- Sum of the distances from every node to all other nodes is maximum
- Queries for number of distinct elements in a subarray | Set 2
- Print Binary Search Tree in Min Max Fashion
- Find the largest Complete Subtree in a given Binary Tree
- Count all k-sum paths in a Binary Tree
- Reverse tree path using Queue
- Insertion in n-ary tree in given order and Level order traversal
- Cartesian tree from inorder traversal | Segment Tree
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Generic Trees(N-array Trees)
- Longest subsequence with first and last element greater than all other elements
- Check if the given n-ary tree is a binary tree

Given a Binary tree, the task is to count the number of nodes with two children at a given level L. Examples: Input: 1 /… Read More »

Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent… Read More »

Given a binary tree, the task is to create a new binary tree which is a mirror image of the given binary tree. Examples: Input:… Read More »

Given a tree having every node’s value as either 0 or 1, the task is to find whether the given binary tree contains any sub-tree… Read More »

Given a tree having every node’s value as either 0 or 1, the task is to find the maximum size of the sub-tree in the… Read More »

Given an unsorted array, trim the array such that twice of minimum is greater than the maximum in the trimmed array. Elements should be removed… Read More »

Given a binary tree, the task is to print the sum of nodes in bottom view of the given Binary Tree. Bottom view of a… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. Examples: Input : 1 /… Read More »

Given a binary tree, the task is to print the nodes of the tree in a reverse anti-clockwise spiral manner. Examples: Input : 1 /… Read More »

Given a binary tree, the task is to print all leaf nodes of the given binary tree from left to right. That is, the nodes… Read More »

Given a binary tree and two nodes a and b, the task is to print the minimum and the maximum node value that lies in… Read More »

Given a Complete Binary Tree as an array, the task is to print all of its levels in sorted order. Examples: Input: arr[] = {7,… 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, the… Read More »

Given a binary tree and two nodes, the task is to check if the nodes are siblings of each other or not. Two nodes are… Read More »