algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: correct comment translation in binary_tree.md (#1406)

Browse Source
This commit is contained in:
Flamingo
2024-07-01 15:10:46 +08:00
committed by GitHub
parent 27d59f65a6
commit f4a6d2127c
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
en/docs/chapter_tree/binary_tree.md
View File

@ -57,7 +57,7 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
Left *TreeNode Left *TreeNode
Right *TreeNode Right *TreeNode
} }
/* 构造方法 */ /* Constructor */
func NewTreeNode(v int) *TreeNode { func NewTreeNode(v int) *TreeNode {
return &TreeNode{ return &TreeNode{
Left: nil, // Pointer to left child node Left: nil, // Pointer to left child node
@ -141,7 +141,7 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
} }
impl TreeNode { impl TreeNode {
/* 构造方法 */ /* Constructor */
fn new(val: i32) -> Rc<RefCell<Self>> { fn new(val: i32) -> Rc<RefCell<Self>> {
Rc::new(RefCell::new(Self { Rc::new(RefCell::new(Self {
val, val,
@ -158,12 +158,12 @@ A <u>binary tree</u> is a non-linear data structure that represents the hierarch
/* Binary tree node */ /* Binary tree node */
typedef struct TreeNode { typedef struct TreeNode {
int val; // Node value int val; // Node value
int height; // 节点高度 int height; // Node height
struct TreeNode *left; // Pointer to left child node struct TreeNode *left; // Pointer to left child node
struct TreeNode *right; // Pointer to right child node struct TreeNode *right; // Pointer to right child node
} TreeNode; } TreeNode;
/* 构造函数 */ /* Constructor */
TreeNode *newTreeNode(int val) { TreeNode *newTreeNode(int val) {
TreeNode *node; TreeNode *node;