isLouisHsu / isLouisHsu/isLouisHsu.github.io
【数据结构】平衡搜索树——分裂树和B树 | LOUIS' BLOG
Open
Nobody has claimed this yet.
ffaf3c1b1a8b7850df9e2f4891624256
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
分裂树定义与概念在字典的很多实际应用中，令我们更感兴趣的不是一个单独操作所需时间，而是一个操作序列所需时间，此时应用的时间复杂度取决于一个字典操作序列而不是任意一个操作。 伸展树基于以下假设：想要对一个二叉查找树执行一系列的查找操作，为了使整个查找时间更小，根据每次的搜索关键字对树的结构进行自调整，使得被查频率高的那些条目就应当经常处于靠近树根的位置。 定义：分裂树(splay 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 by reading the linked Chinese article about splay trees and B-trees. The issue does not identify a file, test, requested change, or completion criteria, so clarify how this content should be incorporated before beginning work.
Written by the indexing model from the issue text.
Assessment
- Domain
- content
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100