## Find Maximum Difference Between a Node and its Descendants in a Binary Tree

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

Coding made easy

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.

Given a sorted Doubly Linked List, in-place convert it into a height-balanced Binary Search Tree (BST). The difference between the height of the left and right subtree for every node of a height-balanced BST is never greater than 1.

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

Given a BST and a valid range of keys, remove nodes from BST that have keys outside the valid range.

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 search tree, find a pair with given sum present in it.

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 …

Given a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.

Given a binary tree, write an efficient algorithm to invert binary tree.