isLouisHsu / isLouisHsu/isLouisHsu.github.io
【数据结构】竞赛树 | LOUIS' BLOG
Open
Nobody has claimed this yet.
6ddc69ac0b9e74db427d9f5b8443bc37
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
定义及概念定义：竞赛树(tournament tree)也是完全二叉树，它的基本操作是替换最大(或最小)元素。如果有$n$个元素，这个基本操作的用时为$\Theta(\log n)$。 竞赛树可分为赢者树(winner tree)和输者树(loser tree)，每个内部节点分别记录比赛的赢者和输者。在最小赢者树(min winner tree)中，分数小的选手获胜，分数相等则左孩子获胜，最大赢者
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the linked tournament-tree article and inspect how blog content is organized in the repository. The issue names no target file, test, or specific change, so confirm the intended scope with the maintainer; completion should be judged by whether the requested tournament-tree material is published in the expected blog format.
Written by the indexing model from the issue text.
Assessment
- Domain
- content, documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100