CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-06-15 22:57:48 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add ru version (#1865)

Browse Source 
* Add Russian docs site baseline

* Add Russian localized codebase

* Polish Russian code wording

* Update ru code translation.

* Update code translation and chapter covers.

* Fix pythontutor extraction.

* Add README and landing page.

* placeholder of profiles

* Use figures of English version

* Remove chapter paperbook
This commit is contained in:
Yudong Jin
2026-03-28 04:24:07 +08:00
committed by GitHub
parent 2ca570cc33
commit 772183705e
1958 changed files with 108186 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

43
ru/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"
/* Driver Code */
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);
// Вставить узел P между n1 -> n2
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;
}