algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-05 06:37:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: add Japanese translate documents (#1812)

Browse Source 
* docs: add Japanese documents (`ja/docs`)

* docs: add Japanese documents (`ja/codes`)

* docs: add Japanese documents

* Remove pythontutor blocks in ja/

* Add an empty at the end of each markdown file.

* Add the missing figures (use the English version temporarily).

* Add index.md for Japanese version.

* Add index.html for Japanese version.

* Add missing index.assets

* Fix backtracking_algorithm.md for Japanese version.

* Add avatar_eltociear.jpg. Fix image links on the Japanese landing page.

* Add the Japanese banner.

---------

Co-authored-by: krahets <krahets@163.com>
This commit is contained in:
Ikko Eltociear Ashimine
2025-10-17 06:04:43 +09:00
committed by GitHub
parent 2487a27036
commit 954c45864b
886 changed files with 33569 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

43
ja/codes/cpp/chapter_tree/binary_tree.cpp Normal file
View File

@ -0,0 +1,43 @@
/**
* File: binary_tree.cpp
* Created Time: 2022-11-25
* Author: krahets (krahets@163.com)
*/
#include "../utils/common.hpp"
/* ドライバーコード */
int main() {
/* 二分木を初期化 */
// ノードを初期化
TreeNode *n1 = new TreeNode(1);
TreeNode *n2 = new TreeNode(2);
TreeNode *n3 = new TreeNode(3);
TreeNode *n4 = new TreeNode(4);
TreeNode *n5 = new TreeNode(5);
// ノードの参照（ポインタ）を構築
n1->left = n2;
n1->right = n3;
n2->left = n4;
n2->right = n5;
cout << endl << "二分木を初期化\n" << endl;
printTree(n1);
/* ノードの挿入と削除 */
TreeNode *P = new TreeNode(0);
// n1 -> n2の間にノードPを挿入
n1->left = P;
P->left = n2;
cout << endl << "ノード P を挿入後\n" << endl;
printTree(n1);
// ノードPを削除
n1->left = n2;
delete P; // メモリを解放
cout << endl << "ノード P を削除後\n" << endl;
printTree(n1);
// メモリを解放
freeMemoryTree(n1);
return 0;
}