## Find next right node of a given key

Given a Binary tree and a key in the binary tree, find the node right to the given key. If there is no node on… Read More »

- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Check which player visits more number of Nodes
- Queries for the minimum element in an array excluding the given index range
- Sum of nodes in the left view of the given binary tree
- Convert ternary expression to Binary Tree using Stack
- Minimum distance to visit all the nodes of an undirected weighted tree
- Convert Directed Graph into a Tree
- Duplicate subtree in Binary Tree | SET 2
- Find Maximum Level Sum in Binary Tree using Recursion
- Sum of nodes in the right view of the given binary tree
- Delete the last leaf node in a Binary Tree
- Convert a given Binary tree to a tree that holds Logical OR property
- Print odd positioned nodes of even levels in level order of the given binary tree
- Sink even nodes in Binary Tree
- Print odd positioned nodes of odd levels in level order of the given binary tree
- Print even positioned nodes of odd levels in level order of the given binary tree
- Difference between General tree and Binary tree
- Skewed Binary Tree
- Extended Binary Tree

Given a Binary tree and a key in the binary tree, find the node right to the given key. If there is no node on… Read More »

Given a Binary Tree, find the deepest leaf node that is left child of its parent. For example, consider the following tree. The deepest left… Read More »

Given a Binary Tree, extract all leaves of it in a Doubly Linked List (DLL). Note that the DLL need to be created in-place. Assume… Read More »

Given a binary tree, a complete path is defined as a path from root to a leaf. The sum of all nodes on that path… Read More »

Given a Binary Search Tree (BST), modify it so that all greater values in the given BST are added to every node. For example, consider… Read More »

Given a Binary Tree, print left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from… Read More »

Given a Binary Tree, check if all leaves are at same level or not. 12 / \ 5 7 / \ 3 1 Leaves are… Read More »

Write a code to get the depth of the deepest odd level leaf node in a binary tree. Consider that level starts with 1. Depth… Read More »

Given Inorder and Preorder traversals of a binary tree, print Postorder traversal. Example: Input: Inorder traversal in[] = {4, 2, 5, 1, 3, 6} Preorder… Read More »

Given a a Binary Tree, find the difference between the sum of nodes at odd level and the sum of nodes at even level. Consider… Read More »

Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL). The left and right pointers in nodes are to be used as previous… Read More »

You are given a set of links, e.g. a —> b b —> c b —> d a —> e Print the tree that would… Read More »

There are two conventions to define the height of a Binary Tree 1) Number of nodes on the longest path from the root to the… Read More »

Write a function to detect if two trees are isomorphic. Two trees are called isomorphic if one of them can be obtained from other by… Read More »

Given a Binary Tree (Bt), convert it to a Doubly Linked List(DLL). The left and right pointers in nodes are to be used as previous… Read More »