Leetcode

Convert BST to Greater Sum Tree

Problem Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST. Examples Example 1: ...

Longest Absolute File Path Problem

Problem Suppose we have a file system that stores both files and directories. An example of one system is represented in the following picture: ...