isLouisHsu / isLouisHsu/isLouisHsu.github.io

【数据结构】二叉树及其他树 | LOUIS' BLOG

Open
#59 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

8999153de61eaccf7ab0bd995c7f63ba Gitalk
Dominant language
HTML
Stars
4
Forks
1
PR merge metrics
No merged PRs in 30d

Description

https://louishsu.xyz/2020/02/29/%E3%80%90%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E3%80%91%E4%BA%8C%E5%8F%89%E6%A0%91%E5%8F%8A%E5%85%B6%E4%BB%96%E6%A0%91/

树定义:一棵树$t$是一个非空的有限元素的集合,其中一个元素为根(root),其余元素组成$t$的子树。根据树的形态,有如下术语:孩子(child)、父母(parent)、兄弟(sibling)、孙子(grandchild)、祖父(grandparent)、祖先(ancestor)、后代(descendent)等等。树中没有孩子的元素称作叶子(leaf)。 树的另一常用术语为级(level)。树根

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading the linked post about binary and other trees. The issue does not identify a correction, addition, target file, or acceptance criteria, so first clarify what content should change and how completion will be verified.

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
15/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.