Counting Maximal Value Roots in Binary Tree using Depth First Search Algorithm
Given a binary tree root, count and return the number of nodes where its value is greater than or equal to the values of all of its descendants. For …
Category: algorithms
Find the Minimum Cost to Sort the Array in Ascending or Descending Order
Given a list of integers nums, return the minimum cost of sorting the list in ascending or descending order. The cost is defined as the sum of differences between …
Binary Search Algorithm to Find the Inverse of a Monotone Increasing Function
Given a Monotone Increasing Function f(x) and if y=f(x) is known, find the value of x. Find the x by Binary Search Algorithm Because function f(x) is monotone increasing …
Depth First Search Algorithm to Find the Largest Difference Between Node and a Descendant in a Binary Tree
Given a binary tree root, return the largest absolute difference between any node and its descendants. For example, given the following tree: 0 / \ 4 2 / \ …
Large to Small Sorting Algorithm using Two Pointer
Given a list of integers nums, sort the list in the following way: First number is the maximum Second number is the minimum Third number is the 2nd maximum …