fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update JavaScript code to docs style (Chapter of Tree)

Browse Source
This commit is contained in:
justin 2022-12-13 21:44:14 +08:00
parent 2a375ebcbb
commit 07ca137e78
2 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
codes/javascript/include/TreeNode.js
View File

@ -8,9 +8,9 @@
* Definition for a binary tree node. * Definition for a binary tree node.
*/ */
function TreeNode(val, left, right) { function TreeNode(val, left, right) {
this.val = (val === undefined ? 0 : val) // 结点值 this.val = (val === undefined ? 0 : val); // 结点值
this.left = (left === undefined ? null : left) // 左子结点指针 this.left = (left === undefined ? null : left); // 左子结点指针
this.right = (right === undefined ? null : right) // 右子结点指针 this.right = (right === undefined ? null : right); // 右子结点指针
} }
/** /**

14
docs/chapter_tree/binary_tree.md
View File

@ -65,9 +65,9 @@ comments: true
```js title="" ```js title=""
/* 链表结点类 */ /* 链表结点类 */
function TreeNode(val, left, right) { function TreeNode(val, left, right) {
this.val = (val === undefined ? 0 : val) // 结点值 this.val = (val === undefined ? 0 : val); // 结点值
this.left = (left === undefined ? null : left) // 左子结点指针 this.left = (left === undefined ? null : left); // 左子结点指针
this.right = (right === undefined ? null : right) // 右子结点指针 this.right = (right === undefined ? null : right); // 右子结点指针
} }
``` ```
@ -201,10 +201,10 @@ comments: true
/* 初始化二叉树 */ /* 初始化二叉树 */
// 初始化结点 // 初始化结点
let n1 = new TreeNode(1), let n1 = new TreeNode(1),
n2 = new TreeNode(2), n2 = new TreeNode(2),
n3 = new TreeNode(3), n3 = new TreeNode(3),
n4 = new TreeNode(4), n4 = new TreeNode(4),
n5 = new TreeNode(5); n5 = new TreeNode(5);
// 构建引用指向（即指针） // 构建引用指向（即指针）
n1.left = n2; n1.left = n2;
n1.right = n3; n1.right = n3;