mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-04 03:14:09 +08:00
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
41 lines
1.1 KiB
Java
41 lines
1.1 KiB
Java
/**
|
|
* File: binary_tree.java
|
|
* Created Time: 2022-11-25
|
|
* Author: krahets (krahets@163.com)
|
|
*/
|
|
|
|
package chapter_tree;
|
|
|
|
import utils.*;
|
|
|
|
public class binary_tree {
|
|
public static void main(String[] args) {
|
|
/* Initialize binary tree */
|
|
// Initialize 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
|
|
n1.left = n2;
|
|
n1.right = n3;
|
|
n2.left = n4;
|
|
n2.right = n5;
|
|
System.out.println("\nInitialize binary tree\n");
|
|
PrintUtil.printTree(n1);
|
|
|
|
/* Insert node P between n1 -> n2 */
|
|
TreeNode P = new TreeNode(0);
|
|
// Delete node
|
|
n1.left = P;
|
|
P.left = n2;
|
|
System.out.println("\nAfter inserting node P\n");
|
|
PrintUtil.printTree(n1);
|
|
// Remove node P
|
|
n1.left = n2;
|
|
System.out.println("\nAfter removing node P\n");
|
|
PrintUtil.printTree(n1);
|
|
}
|
|
}
|