InterviewBit Problems   Next Greater Number BST : Solved

About the Next Greater Number BST : Solved category (1)
Java Solution - time complexity O(h), space O(1) (1)
C++ solution in O(log n) (1)
Iterative Inorder Traversal (1)
Wrong _solution in this case (1)
Simplest Solution in Python by NoOne46...! (1)
Simple C++ soln | Inorder successor (1)
Easy Python Solution Without Recursion (1)
Very easy solution using preorder traversal (without recursion) in C++ (1)
5 lines code c++ (1)
Solution using Python! (1)
Very simple solution in java(Is it correct for all test cases as interviewbit passed it correctly) (2)
Very simple solution. finishing in 5 lines (1)
Different approach without searching or finding min (1)
CPP solution without using recursion (1)
What about traverse tree in order using stack the first element you hit greater t (2)