Great Tree

Binary Search Trees Contest Medium

Given a root of binary search tree. Convert the binary tree to Great tree such that every original key of BST is changed to original value plus sum of all keys greater than original key in BST.

Constraints

1 <= Number of Nodes <= 100
1 <= node value <= 10⁴

Company Tags

[ ]

Code

✅ Testcase

Input: {'root': '5 1 7 null null 6 10'}

Expected:
28 29 17 null null 23 10 null null null null

Actual: -

Time: - sec

Status: Waiting

Problem List

Great Tree

Constraints

Company Tags

Editorial

Notes

Code