Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that |weight[i] – x| is minimum.
x = 15
Node 1: |5 – 15| = 10
Node 2: |10 – 15| = 5
Node 3: |11 -15| = 4
Node 4: |8 – 15| = 7
Node 5: |6 -15| = 9
Approach: Perform dfs on the tree and keep track of the node whose weighted absolute difference with x gives the minimum value.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find the node whose absolute difference with X gives maximum value
- Find the node whose xor with x gives minimum value
- Find the node whose xor with x gives maximum value
- All pairs whose xor gives unique prime
- Find K elements whose absolute difference with median of array is maximum
- Count maximum elements of an array whose absolute difference does not exceed K
- Check if there exists a prime number which gives Y after being repeatedly subtracted from X
- Find the minimum absolute difference in two different BST's
- Minimum cost path from source node to destination node via an intermediate node
- Find the node whose sum with X has minimum set bits
- Pair with minimum absolute difference after solving each query
- Minimum absolute difference between N and a power of 2
- Pair with minimum absolute difference | BST
- Subsequence with maximum pairwise absolute difference and minimum size
- Find the node with minimum value in a Binary Search Tree
- Find the node with minimum value in a Binary Search Tree using recursion
- Maximize removal of adjacent array elements based on their absolute value
- Find the node whose sum with X has maximum set bits
- Minimum value of distance of farthest node in a Graph
- Minimum edges to be added in a directed graph so that any node can be reachable from a given node
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.