About this assistant

What it is

A practice-question generator for the binary tree / binary search tree coding part of the DSA final. Pick a question type (iterative or recursive, BT or BST) and the assistant asks a language model for a complete exam-style question: problem statement, example tree, starter code, and a full solution with complexity analysis and walkthroughs. The solution stays hidden until you choose to reveal it, and the assistant remembers your last few questions (in this browser only) to avoid repeats.

What it is not

• Not a source of truth: questions and solutions are written by an AI on the spot. They are usually good practice, but read them critically — models make mistakes, and the final exam is written by your instructor, not a model.
• Not a grader: it does not check your answers; compare your work against the revealed solution yourself.

Your API key and privacy

• You bring your own OpenRouter API key. It is sent only to openrouter.ai, over HTTPS, when you click Generate — there is no server of ours in between, no login, and no database.
• The key stays in memory unless you explicitly tick "Remember the key in this browser", which stores it in your browser's localStorage; unticking removes it.
• Free models on OpenRouter work without credits — the model picker lists them first.

Family

Part of the DSA tools family, alongside the Time Complexity Playground and the Recursive Functions Visualizer — same styling, same privacy stance. This app is the web successor of the instructor's earlier Express-based final-exam helper.