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

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.

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

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

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

Given a binary tree whose nodes are labelled from 0 to n-1, construct an ancestor matrix from it. An ancestor matrix is a boolean matrix, whose cell (i, j) is true if i is ancestor of j in the binary tree.

Write an efficient algorithm to find postorder traversal of a binary tree from its inorder and preorder sequence.

Given a binary tree, write an iterative algorithm to print leaf to root path for every leaf node of binary tree. Use of Recursion is prohibited.

Given a binary tree, write an efficient algorithm to compute maximum width of it.

Given an array A which represents a binary tree such that the parent-child relationship is defined by (A[i], i) for every index i in the array A, build binary tree out of it. The value of root node will be i if -1 is present at index i in the array. It may be assumed …