We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 84f3acf commit 70cd7e8Copy full SHA for 70cd7e8
scripts/algorithms/R/Recover Binary Search Tree/Recover Binary Search Tree.js
@@ -1,3 +1,4 @@
1
+// Runtime: 269 ms (Top 19.02%) | Memory: 52.1 MB (Top 64.55%)
2
var recoverTree = function(root) {
3
const arr = [];
4
const traverse = (r = root) => {
@@ -7,7 +8,7 @@ var recoverTree = function(root) {
7
8
traverse(r.right);
9
}
10
traverse();
-
11
+
12
arr.sort((a, b) => a - b);
13
let k = 0;
14
const recover = (r = root) => {
@@ -18,4 +19,4 @@ var recoverTree = function(root) {
18
19
20
recover();
21
return root;
-};
22
+};
0 commit comments