translation: Update chap_tree/summary.md #1555
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
I have changed some wording, and for line 37, since I do not know c++, I am not sure whether to use "function" or "method". |
steventimes
changed the title
|
Functions defined in an object in cpp is usually referred as a “method”, this follows the terminology commonly accepted in object-oriented programming. |
yuelinxin
reviewed
Dec 12, 2024
en/docs/chapter_tree/summary.md
Outdated
| @@ -1,26 +1,26 @@ | |||
| # Summary | |||
|
|
|||
| ### Key review | |||
| ### Key Highlights | |||
There was a problem hiding this comment.
we have fixed this title throughout this book so no need to change this
|
I have updated the file with the changed title, and named back to "method". Thank you |
yuelinxin
approved these changes
Dec 13, 2024
magentaqin
reviewed
Dec 16, 2024
| @@ -3,24 +3,24 @@ | |||
| ### Key review | |||
|
|
|||
| - A binary tree is a non-linear data structure that reflects the "divide and conquer" logic of splitting one into two. Each binary tree node contains a value and two pointers, which point to its left and right child nodes, respectively. | |||
| - For a node in a binary tree, the tree formed by its left (right) child node and all nodes under it is called the node's left (right) subtree. | |||
| - Related terminology of binary trees includes root node, leaf node, level, degree, edge, height, and depth, among others. | |||
| - For a node in a binary tree, its left (right) child node and the tree formed below it is called the node's left (right) subtree. | |||
There was a problem hiding this comment.
"is called" => "are collectively called"
| - The operations of initializing a binary tree, inserting nodes, and removing nodes are similar to those of linked list operations. | ||
| - Common types of binary trees include perfect binary trees, complete binary trees, full binary trees, and balanced binary trees. The perfect binary tree represents the ideal state, while the linked list is the worst state after degradation. | ||
| - A binary tree can be represented using an array by arranging the node values and empty slots in a level-order traversal sequence and implementing pointers based on the index mapping relationship between parent nodes and child nodes. | ||
| - The level-order traversal of a binary tree is a breadth-first search method, which reflects a layer-by-layer traversal manner of "expanding circle by circle." It is usually implemented using a queue. | ||
| - Pre-order, in-order, and post-order traversals are all depth-first search methods, reflecting the traversal manner of "going to the end first, then backtracking to continue." They are usually implemented using recursion. | ||
| - A binary search tree is an efficient data structure for element searching, with the time complexity of search, insert, and remove operations all being $O(\log n)$. When a binary search tree degrades into a linked list, these time complexities deteriorate to $O(n)$. | ||
| - An AVL tree, also known as a balanced binary search tree, ensures that the tree remains balanced after continuous node insertions and removals through rotation operations. | ||
| - Rotation operations in an AVL tree include right rotation, left rotation, right-then-left rotation, and left-then-right rotation. After inserting or removing nodes, an AVL tree performs rotation operations from bottom to top to rebalance the tree. | ||
| - Rotation operations in an AVL tree include right rotation, left rotation, right-left rotation, and left-right rotation. After inserting or removing nodes, the AVL tree performs rotation operations from bottom to top to rebalance the tree. |
There was a problem hiding this comment.
If you use "inserting/removing", the subject should be "we". How about updating this to "After node insertion or removal, the AVL tree rebalances itself by performing these rotations in a bottom-up manner."?
|
|
||
| ### Q & A | ||
|
|
||
| **Q**: For a binary tree with only one node, are both the height of the tree and the depth of the root node $0$? | ||
|
|
||
| Yes, because height and depth are typically defined as "the number of edges passed." | ||
|
|
||
| **Q**: The insertion and removal in a binary tree are generally completed by a set of operations. What does "a set of operations" refer to here? Can it be understood as the release of resources of the child nodes? | ||
| **Q**: The insertion and removal in a binary tree are generally accomplished by a set of operations. What does "a set of operations" refer to here? Can it be understood as the release of resources of the child nodes? |
There was a problem hiding this comment.
Can it be understood...? => Does it imply releasing the resources of the child nodes?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
If this pull request (PR) pertains to Chinese-to-English translation, please confirm that you have read the contribution guidelines and complete the checklist below:
If this pull request (PR) is associated with coding or code transpilation, please attach the relevant console outputs to the PR and complete the following checklist: