## Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

Objective: Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Example: int[] arrA = { 12, 3, 1, 5, 6, 4, 10, 9, 8, 0 }; Output: Max(j-i)...

Skip to content# Tagged: Intermediate

## Given an array arrA[], find the maximum j – i such that arr[j] > arr[i].

## Search an Element in a Rotated Sorted Array

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

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

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

## Print the Vertical Sum in binary Tree .

## Print the Binary Tree in Vertical Order Path.

## Lowest Common Ancestor in a Binary Search Tree.

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

## Reverse Alternate levels of a given Binary Tree.

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

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

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

## Print Left View of a given binary tree

## Print Right View of a given binary tree

@tutorialhorizon

Objective: Given an array arrA[], find the maximum j – i such that arr[j] > arr[i]. Example: int[] arrA = { 12, 3, 1, 5, 6, 4, 10, 9, 8, 0 }; Output: Max(j-i)...

Input: Rotated Sorted Array. What is Rotated Sorted Array. A sorted array is rotated around some pivot element. See the Example Below, array is rotated after 6. Approach:

Objective: – Given Binary Tree, Print All The Nodes Which are X distance from the Leaf Nodes Example : Approach:

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

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:

Objective: – Given a binary tree, print it in vertical order sum What is Vertical Order Sum as you can see in the example above, [4],[2], [12],[3],[7] are the vertical order sum of the...

Objective: – Given a binary tree, print it in vertical order path. What is Vertical Order as you can see in the example above, [4],[2], [1,5,6],[3],[7] are the verical order of the given binary...

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...

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...

Objective: – Reverse Alternate levels of a given binary tree Input: A binary tree Example: Appraoch:

Objective: 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 first node as root and...

Objective: Given a sorted doubly linked list, convert it into Balanced binary search tree Input: A Doubly Linked List Example: Approach:

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

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...

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...

%d bloggers like this: