Given a binary tree and two nodes a and b, the task is to print the minimum and the maximum node value that lies in the path connecting the given nodes a and b. If either of the two nodes is not present in the tree then print -1 for both minimum and maximum value.
Input: 1 / \ 2 3 / \ \ 4 5 6 / / \ 7 8 9 a = 5, b = 6 Output: Min = 1 Max = 6 Input: 20 / \ 8 22 / \ / \ 5 3 4 25 / \ 10 14 a = 5, b = 14 Output: Min = 3 Max = 14
Approach: The idea is to find the LCA of both the nodes. Then start searching for the minimum and the maximum node in the path from LCA to the first node and then from LCA to the second node and print the minimum and the maximum of these values. In case either of the node is not present in the tree then print -1 for the minimum as well as the maximum value
Below is the implementation of the above approach:
Min = 3 Max = 14
- Sum of all odd nodes in the path connecting two given nodes
- Implementing a BST where every node stores the maximum number of nodes in the path till any leaf
- XOR of path between any two nodes in a Binary Tree
- Maximum XOR with given value in the path from root to given node in the tree
- Print path between any two nodes in a Binary Tree
- Print path from root to a given node in a binary tree
- Sort the path from root to a given node in a Binary Tree
- Shortest path between two nodes in array like representation of binary tree
- Print path from root to all nodes in a Complete Binary Tree
- Find triplet such that number of nodes connecting these triplets is maximum
- Print the nodes of binary tree as they become the leaf node
- Distance between two nodes of binary tree with node values from 1 to N
- Print all the nodes except the leftmost node in every level of the given binary tree
- Convert a Binary Tree such that every node stores the sum of all nodes in its right subtree
- Maximum Path Sum in a Binary Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : rituraj_jain