algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace 结点 with 节点 (#452)

Browse Source 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
This commit is contained in:
Yudong Jin
2023-04-09 04:32:17 +08:00
committed by GitHub
parent 3f4e32b2b0
commit 1c8b7ef559
395 changed files with 2056 additions and 2056 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/javascript/chapter_tree/binary_tree_dfs.js
View File

@@ -13,7 +13,7 @@ const list = [];
/* 前序遍历 */
function preOrder(root) {
if (root === null) return;
// 访问优先级：根结点 -> 左子树 -> 右子树
// 访问优先级：根节点 -> 左子树 -> 右子树
list.push(root.val);
preOrder(root.left);
preOrder(root.right);
@@ -22,7 +22,7 @@ function preOrder(root) {
/* 中序遍历 */
function inOrder(root) {
if (root === null) return;
// 访问优先级：左子树 -> 根结点 -> 右子树
// 访问优先级：左子树 -> 根节点 -> 右子树
inOrder(root.left);
list.push(root.val);
inOrder(root.right);
@@ -31,7 +31,7 @@ function inOrder(root) {
/* 后序遍历 */
function postOrder(root) {
if (root === null) return;
// 访问优先级：左子树 -> 右子树 -> 根结点
// 访问优先级：左子树 -> 右子树 -> 根节点
postOrder(root.left);
postOrder(root.right);
list.push(root.val);
@@ -47,14 +47,14 @@ printTree(root);
/* 前序遍历 */
list.length = 0;
preOrder(root);
console.log("\n前序遍历的结点打印序列 = " + list);
console.log("\n前序遍历的节点打印序列 = " + list);
/* 中序遍历 */
list.length = 0;
inOrder(root);
console.log("\n中序遍历的结点打印序列 = " + list);
console.log("\n中序遍历的节点打印序列 = " + list);
/* 后序遍历 */
list.length = 0;
postOrder(root);
console.log("\n后序遍历的结点打印序列 = " + list);
console.log("\n后序遍历的节点打印序列 = " + list);