Find the diagonal sum of a binary tree
Given a binary tree, calculate the sum of all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes a 45–degree angle with the parent.
Tag: Medium
Determine whether a given binary tree is a BST or not
Given a binary tree, determine if it is a BST or not. This problem has a simple recursive solution. The BST property is the key to figuring out whether a tree is a BST or not.
Deletion from BST (Binary Search Tree)
Deletion from BST – write an efficient function to delete a given key in BST. To delete a node from BST, there are three possible cases to consider.
Find maximum sum root to leaf path in a binary tree
Given a binary tree, write an efficient algorithm to find the maximum sum root-to-leaf path, i.e., the maximum sum path from the root node to any leaf node in it.
Truncate a binary tree to remove nodes that lie on a path having a sum less than `k`
Given a binary tree and a number k, remove nodes from the tree which lie on a complete path having a sum less than k.
Convert a binary tree to a full tree by removing half nodes
Given a binary tree, convert it into a full tree by removing half nodes (remove nodes having one child).
Print diagonal traversal of a binary tree
Given a binary tree, print all nodes for each diagonal having negative slope (\). Assume that the left and right child of a node makes a 45–degree angle with the parent.
Perform vertical traversal of a binary tree
Given a binary tree, perform vertical traversal on it. In vertical traversal, nodes of a binary tree are printed in vertical order. Assume that the left and right child makes a 45–degree angle with the parent.
Find ancestors of a given node in a binary tree
Given a binary tree, find all ancestors of a given node in it.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree
Given a binary tree and two nodes, x and y, find the lowest common ancestor (LCA) of x and y in it. The lowest common ancestor (LCA) of two nodes x and y in a binary tree is the lowest (i.e., deepest) node that has both x and y as descendants, where each node can be a descendant of itself.
Inorder Tree Traversal – Iterative and Recursive
Given a binary tree, write an iterative and recursive solution to traverse the tree using inorder traversal in C++, Java, and Python.
Preorder Tree Traversal – Iterative and Recursive
Given a binary tree, write an iterative and recursive solution to traverse the tree using preorder traversal in C++, Java, and Python.