## Fix a binary tree that is only one swap away from becoming a BST

Given a binary tree that is only one swap away from becoming a BST, convert the binary tree into BST in single traversal of it. Get great deals at Amazon

Coding made easy

Given a binary tree that is only one swap away from becoming a BST, convert the binary tree into BST in single traversal of it. Get great deals at Amazon

Given a binary tree, write an efficient algorithm to find maximum sum path between any two leaves in it.

Given a binary tree, write an efficient algorithm to find all nodes present at given distance from any leaf node. We need to find only those nodes that are present in root-to-leaf path for that leaf.

Given a positive integer n, print all combination of numbers from 1 to n having sum n.

Given a binary tree, count all subtrees in it such that every node in the subtree have same value.

Given a BST, find inorder successor of a given key in it. If the given key do not lie in the BST, then return the next greater key (if any) present in the BST.

Write a program to count number of ways to calculate a target number from elements of specified array by using only addition and subtraction operator. The use of any other operator is forbidden.

Given N lists of words, print all combinations of phrases that can be formed by picking one word each from each of the given lists.

Given a linked list, rearrange it by separating odd nodes from even ones. All even nodes should come before all odd nodes in the output list and the relative order of even and odd nodes should be maintained.

Given a binary tree, find maximum difference between a node and its descendants in it.

In Pots of gold game, there are two players A & B and pots of gold arranged in a line, each containing some gold coins. The players can see how many coins are there in each gold pot and each player gets alternating turns in which the player can pick a pot from one of …

Given a binary tree, write an efficient algorithm to print right view of given binary tree.