InterviewBit Problems   Recover Binary Search Tree : Unsolved


About the Recover Binary Search Tree : Unsolved category (1)
Please help me to figure out the problem in my code (1)
The expected outcomes test case (2)
O(1) solution without using Morris traversal (2)
Easy solution. have a look (4)
Solution O(1) easy (2)
Why is it showing run time error (2)
Weak Test cases in the code (2)
Can some one tell me why my code is failing (2)
Giving right answer in custom test case but not working in actual test (3)
Tip to solve it (1)
Wrong expected result for input 57 92 82 85 81 83 -1 88 70 -1 -1 -1 86 91 69 78 -1 87 89 84 -1 -1 76 80 -1 -1 -1 90 -1 96 75 77 79 -1 -1 -1 95 -1 74 -1 -1 -1 -1 -1 93 -1 72 -1 -1 94 71 73 -1 -1 -1 -1 -1 -1 (3)
Can some one help me findout bugg! (1)
Is this a half question? (2)
Recusrion is not counted as extra space (1)
Issue in saving changes added to my code (1)
Something is wrong with TreeNode class (1)
Doubt in test case! (1)
Expected output differing (1)
Test Case: 1295 309 131 506 55 180 313 592 31 88 138 305 310 380 509 618 25 46 71 (4)
Very good practice! But in reality, is it worth to optmize an O(logN) space to (2)
Zero points awarded even after successful submission (1)
Title of yowrong t est caseur comment (2)
Global Varibal can occur wrong answer (1)
Grader needs result to be sorted (1)
Will recursion be counted as additional space? (1)
Can you tell me the custom input for the tree given in example (appears when cus (3)
We have to do it in O(n) space or O(1) or any? (2)