@rohan99 I don't understand how to make sure the time complexity here. Because according to recursion formula: T(n) = T(n-1) + T(n/2) + O(1), but how to get the time complexity from it. I don't know, can you explain it in detail? Thanks.
Serialize and Deserialize Binary Tree