## Print All The Nodes Which are X distance from the Root

Objective: Given Binary Tree, Print all the nodes which are X distance from the root

Example :

Appraoch:

Read morePrint All The Nodes Which are X distance from the Root

## Find The Distance From Root To Given Node of a Binary Tree.

Objective: Find The Distance From Root To Given Node of a binary tree.

What does Distance means : It means number of edges between two nodes.

Approach:

Read moreFind The Distance From Root To Given Node of a Binary Tree.

## Print the Vertical Sum in binary Tree .

Objective: Given a binary tree, print it in vertical order sum

What is Vertical Order Sum as you can see in the example above, ,, ,, are the vertical order sum of the given binary tree.

Approach:

Read morePrint the Vertical Sum in binary Tree .

## Print the Binary Tree in Vertical Order Path.

Objective: Given a binary tree, print it in vertical order path.

What is Vertical Order as you can see in the example above, ,, [1,5,6],, are the verical order of the given binary tree.

Approach:

Read morePrint the Binary Tree in Vertical Order Path.

## Lowest Common Ancestor in a Binary Search Tree.

Objective: Find the Lowest Common Ancestor of two given nodes in a Binary Search Tree

What is Lowest Common Ancestor

In a given binary tree, The lowest common ancestor of two nodes n1 and n2 will be a node X such that node X will be the lowest node who has n1 and n2 as its descendants.

Similar Problem: Lowest Common Ancestor in a Binary Tree ( Not Binary Search Tree).

Example:

Input: A binary Search Tree and two nodes n1 and n2.

Appraoch:

Read moreLowest Common Ancestor in a Binary Search Tree.

## Given a binary tree, find out the maximum sum of value from root to each leaf.

Objective: Find the maximum sum leaf to root path in a Binary Tree. Means in all the paths from root to leaves, find the path which has the maximum sum.

Input: A binary tree

Example: Approach:

Read moreGiven a binary tree, find out the maximum sum of value from root to each leaf.

## Reverse Alternate levels of a given Binary Tree.

Objective: Reverse Alternate levels of a given binary tree

Input: A binary tree

Example:

Appraoch:

Read moreReverse Alternate levels of a given Binary Tree.

## Given a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

Given a Sorted Array, Convert it into its Balanced Binary search TreeObjective: You have been given a sorted singly List, you need to convert it into balanced binary search tree.

Why balanced binary tree is important:

You can also create the first node as root and insert all other nodes to the right of the tree because List is in increasing order but this constructed tree won’t be a balanced tree, it will be the skewed tree and to perform operations on this tree will be O(n), not O(logn).

Input: An sorted Singly Linked List

Output: Balanced Binary Tree

Example:

Approach:

Read moreGiven a Sorted Singly Linked List Array, Convert it into a Balanced Binary search Tree.

## Convert a Sorted Doubly Linked List to Balanced BST.

Objective: Given a sorted doubly linked list, convert it into Balanced binary search tree

Example:

Approach:

## Given a binary tree, Find the Maximum Path Sum between Any Two Leaves

Objective: Given a binary tree, Find the maximum path sum from one leaf node to another.

Input: A binary tree.

Example:

Approach:

Read moreGiven a binary tree, Find the Maximum Path Sum between Any Two Leaves

## Print Left View of a given binary tree

Objective: In a Binary Tree, print left view of it

Input: A binary tree.

What is left View of a binary Tree

When just look at the tree from the left side , all the nodes you can see will be the left view of the tree.

Example: Approach:

Read morePrint Left View of a given binary tree

## Print Right View of a given binary tree

Objective: In a Binary Tree, print right view of it

Input: A binary tree.

What is Right View of a binary Tree?

When just look at the tree from the right side , all the nodes you can see will be the right view of the tree.

Example:

Approach :

Method 1 :

Read morePrint Right View of a given binary tree

## In a Binary Tree, Check if Two nodes has the same parent or are siblings

Objective: In a Binary Tree, Check if Two nodes has the same parent or are siblings

Input: A binary tree and two nodes

Example: Approach:

Read moreIn a Binary Tree, Check if Two nodes has the same parent or are siblings

## In a Binary Tree, Check if two nodes are Cousins

Objective: Given a binary tree and two nodes, Check if they are cousins

Input: A binary tree and two nodes

Cousin Nodes: Cousin nodes are the nodes who are at the same level in the tree and whose parents are siblings.

Example: Approach:

Read moreIn a Binary Tree, Check if two nodes are Cousins

## Print Paths from root to all leaf nodes in a binary tree.

Objective: Given a binary tree, Print paths from root to all leaf nodes

Input: A binary tree

Example: