**Basics**: Given a binary tree write a function to release the tree without using recursion. **Context**: This is deep in the OS so recursion or dynamic memory allocation for control flow is not allowed. You have been given a dynamic data object that contains data about a resource in the OS. It is no longer being used and must thus be released. struct Node { Node* left; Node* right; int. data; // For interview just an integer. Don''t worry about it. } void releaseTree(Node* root) { // Write this part. /// }

Question: Design an Online Judge system that can be used to host online contests in solving algorithmic questions. OK. This one was a bit tricky. But it turned out after some questions that they wanted me to design Hacker Rank (or something similar). Do be blunt, I did a bad job. But I put my heart into it. Here is the RAW result. https://excalidraw.com/#json=Dt9c0gTOpvnyUIZNUBT7O,hMsZ0oNqmb4SFbJSThJo4g

This community is now discoverable on Skool so hopefully we can get some more members in here!😀