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 maximum.
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 maximum value.
Below is the implementation of the above approach:
- Find the node whose absolute difference with X gives minimum value
- Count maximum elements of an array whose absolute difference does not exceed K
- Maximum difference between node and its ancestor in Binary Tree
- Find the node whose xor with x gives maximum value
- Find the node whose sum with X has maximum set bits
- Find the node with maximum value in a Binary Search Tree
- Find the maximum node at a given level in a binary tree
- Minimum absolute difference between N and a power of 2
- Pair with minimum absolute difference after solving each query
- Check whether the sum of absolute difference of adjacent digits is Prime or not
- Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
- Minimum cost path from source node to destination node via an intermediate node
- Node having maximum sum of immediate children and itself in n-ary tree
- Get maximum left node in binary tree
- Iterative Segment Tree (Range Maximum Query with Node Update)
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.