Title: Day -25 Q2: Convert BST to Greater Tree · Issue #605 · SnowScriptWinterOfCode/LeetCode_Q · GitHub
Open Graph Title: Day -25 Q2: Convert BST to Greater Tree · Issue #605 · SnowScriptWinterOfCode/LeetCode_Q
X Title: Day -25 Q2: Convert BST to Greater Tree · Issue #605 · SnowScriptWinterOfCode/LeetCode_Q
Description: 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. As a reminder, a binary sear...
Open Graph Description: 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 ...
X Description: 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 ...
Opengraph URL: https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/605
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Day -25 Q2: Convert BST to Greater Tree","articleBody":"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.\r\n\r\nAs a reminder, a binary search tree is a tree that satisfies these constraints:\r\n\r\nThe left subtree of a node contains only nodes with keys less than the node's key.\r\nThe right subtree of a node contains only nodes with keys greater than the node's key.\r\nBoth the left and right subtrees must also be binary search trees.\r\n \r\n\r\nExample 1:\r\nInput: root = [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]\r\nOutput: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]\r\n\r\nExample 2:\r\nInput: root = [0,null,1]\r\nOutput: [1,null,1]\r\n \r\nConstraints:\r\nThe number of nodes in the tree is in the range [0, 104].\r\n-104 \u003c= Node.val \u003c= 104\r\nAll the values in the tree are unique.\r\nroot is guaranteed to be a valid binary search tree.\r\n ","author":{"url":"https://github.com/Mansi8874","@type":"Person","name":"Mansi8874"},"datePublished":"2024-01-27T06:57:41Z","url":"https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/605"}
| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:64d19727-69d2-7925-f98b-9a05e195b646 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | ED50:2E6021:24314B3:2F312F6:6AFFF30F |
| html-safe-nonce | 09c3a74c4d469667d4ff808b49a15841284ed42f902a86906a055d184015cb62 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJFRDUwOjJFNjAyMToyNDMxNEIzOjJGMzEyRjY6NkFGRkYzMEYiLCJ2aXNpdG9yX2lkIjoiNzkzMTg0NzExNjE1Mjg5NDIyMyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | 7ebaa5e4acefcfe7c86f48046f68f39f871b4003d90db916bb6bb0380b1d1d20 |
| hovercard-subject-tag | issue:2103327927 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/SnowScriptWinterOfCode/LeetCode_Q/605/issue_layout |
| twitter:image | https://opengraph.githubassets.com/be6222f844d6ec8ae233170cbc623508c441b065e65048da539b8bc3425a9e9a/SnowScriptWinterOfCode/LeetCode_Q/issues/605 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/be6222f844d6ec8ae233170cbc623508c441b065e65048da539b8bc3425a9e9a/SnowScriptWinterOfCode/LeetCode_Q/issues/605 |
| og:image:alt | 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 ... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | Mansi8874 |
| hostname | github.com |
| expected-hostname | github.com |
| None | 0a0d8686a27478df474dd7415776a7a080cde8838b3cd92ea7601187572e5729 |
| turbo-cache-control | no-preview |
| go-import | github.com/SnowScriptWinterOfCode/LeetCode_Q git https://github.com/SnowScriptWinterOfCode/LeetCode_Q.git |
| octolytics-dimension-user_id | 154897622 |
| octolytics-dimension-user_login | SnowScriptWinterOfCode |
| octolytics-dimension-repository_id | 735947375 |
| octolytics-dimension-repository_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 735947375 |
| octolytics-dimension-repository_network_root_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 16a11879678aaf97e2a42c33ee70830aa084fa37 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| react-app-name | issues |
Links:
Viewport: width=device-width