## Number of edges in a perfect binary tree with N levels

Given a positive integer N, the task is to find the count of edges of a perfect binary tree with N levels. Examples: Input: N… 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
- 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
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2

Given a positive integer N, the task is to find the count of edges of a perfect binary tree with N levels. Examples: Input: N… Read More »

Given a tree with N vertices numbered from 0 to N – 1 (0th node is the root node). Also, given q queries containing nodes… Read More »

Extended binary tree is a type of binary tree in which all the null sub tree of the original tree are replaced with special nodes… Read More »

A skewed binary tree is a type of binary tree in which all the nodes have only either one child or no child. Types of… Read More »

General Tree: In the data structure, General tree is a tree in which each node can have either zero or many child nodes. It can… Read More »

Given an array arr[] of size N. There is an edge from i to arr[i]. The task is to convert this directed graph into tree… Read More »

Given an array arr[] of N integers and Q queries where each query consists of an index range [L, R]. For each query, the task… Read More »

Given a Binary Tree (Every node has at most 2 children) where each node has value either 0 or 1. The task is to convert… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the left view. The left view of… Read More »

Given a Binary Tree having odd and even elements, sink all it’s even valued nodes such that no node with even value could be a… Read More »

Given a binary tree, the task is to find the sum of the nodes which are visible in the right view. The right view of… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum level in it and print the maximum sum.… Read More »

Given a weighted tree with N nodes starting from 1 to N. The distance between any two nodes is given by the edge weight. Node… Read More »

Given Inorder traversal and Level Order traversal of a Binary Tree. The task is to calculate the height of the tree without constructing it. Example:… Read More »

Given a binary tree, the task is to print the odd positioned nodes of even levels in the level order traversal of the tree. The… Read More »