CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-10 16:00:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
en/codes/cpp/chapter_tree/binary_tree.cpp
View File

@@ -6,34 +6,34 @@
#include "../utils/common.hpp"
/* Driver Code */
/* Driver code */
int main() {
/* Initialize binary tree */
// Initialize nodes
/* Initialize the binary tree */
// Initialize the nodes
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);
// Build references (pointers) between nodes
// Set up references (pointers) between the nodes
n1->left = n2;
n1->right = n3;
n2->left = n4;
n2->right = n5;
cout << endl << "Initialize binary tree\n" << endl;
cout << endl << "Initialize the binary tree\n" << endl;
printTree(n1);
/* Insert node P between n1 -> n2 */
/* Insert and remove nodes */
TreeNode *P = new TreeNode(0);
// Delete node
// Insert node P between n1 and n2 in n1 -> n2
n1->left = P;
P->left = n2;
cout << endl << "After inserting node P\n" << endl;
cout << endl << "After inserting node P:\n" << endl;
printTree(n1);
// Remove node P
n1->left = n2;
delete P; // Free memory
cout << endl << "After removing node P\n" << endl;
cout << endl << "After removing node P:\n" << endl;
printTree(n1);
// Free memory