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
- Find the minimum absolute difference in two different BST's
- 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 maximum node at a given level in a binary tree
- Find the node with maximum value in a Binary Search Tree
- Find the node with maximum value in a Binary Search Tree using recursion
- Minimum absolute difference between N and a power of 2
- Pair with minimum absolute difference | BST
- Check whether the sum of absolute difference of adjacent digits is Prime or not
- Pair with minimum absolute difference after solving each query
- Longest subsequence such that absolute difference between every pair is atmost 1
- Arrange first N natural numbers such that absolute difference between all adjacent elements > 1
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.