ZeKaiNie/universal-examprep-skill / full
universal-exam-cram-coach-full
Verified帮助学生在临考前进行结构化极速复习:解析课程资料/大纲/重点,按章节生成 wiki 知识库与标准题库,组织针对性刷题与判分,并记录复习进度和错题。当用户即将考试、需要快速复习计划、练习题、错题复盘或考前小抄时使用(关键词:期末/备考/复习/刷题/划重点/错题;exam, cram, study plan, quiz, review)。不适用于长期学习规划、与考试无关的写作或编程任务。
benchmark/behavior_smoke/mock/sample_outputs/teaching_template_missing_warn.txt
View on GitHub【重点题精讲】[#mc_q8] 二叉树高度与结点数(坏例:答案是 AI 推导的,但来源行和答案块标题都没有 ⚠️)
② 这题在问什么:
问高度为 h 的二叉树最多有多少个结点。
④ 核心公式:
第 k 层最多 2^(k-1) 个结点,等比求和 → 最多 2^h − 1 个。
⑤ 逐步演算:
1. 第 1 层最多 1 个,第 k 层最多 2^(k-1) 个。
2. 求和:1 + 2 + … + 2^(h-1) = 2^h − 1。
题目来源:hw04.pdf 第 1 页(homework)|答案来源:AI 推导(无教材答案)|🟡 AI补充,可能与你老师讲的不完全一致
Related skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| receiving-code-reviewobra/superpowersUse when receiving code review feedback, before implementing suggestions, especially if feedback seems unclear or technically questionable - requires technical rigor and verification, not performative agreement or blind implementation | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| requesting-code-reviewobra/superpowersUse when completing tasks, implementing major features, or before merging to verify work meets requirements | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| using-git-worktreesobra/superpowersUse when starting feature work that needs isolation from current workspace or before executing implementation plans - ensures an isolated workspace exists via native tools or git worktree fallback | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| verification-before-completionobra/superpowersUse when about to claim work is complete, fixed, or passing, before committing or creating PRs - requires running verification commands and confirming output before making any success claims; evidence before assertions always | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |