mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-04 03:14:09 +08:00
2778a6f9c7
* 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
42 lines
893 B
Python
42 lines
893 B
Python
"""
|
|
File: binary_tree.py
|
|
Created Time: 2022-12-20
|
|
Author: a16su (lpluls001@gmail.com)
|
|
"""
|
|
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
sys.path.append(str(Path(__file__).parent.parent))
|
|
from modules import TreeNode, print_tree
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
# Initialize binary tree
|
|
# Initialize nodes
|
|
n1 = TreeNode(val=1)
|
|
n2 = TreeNode(val=2)
|
|
n3 = TreeNode(val=3)
|
|
n4 = TreeNode(val=4)
|
|
n5 = TreeNode(val=5)
|
|
# Build references (pointers) between nodes
|
|
n1.left = n2
|
|
n1.right = n3
|
|
n2.left = n4
|
|
n2.right = n5
|
|
print("\nInitialize binary tree\n")
|
|
print_tree(n1)
|
|
|
|
# Insert and delete nodes
|
|
P = TreeNode(0)
|
|
# Insert node P between n1 -> n2
|
|
n1.left = P
|
|
P.left = n2
|
|
print("\nAfter inserting node P\n")
|
|
print_tree(n1)
|
|
# Delete node
|
|
n1.left = n2
|
|
print("\nAfter deleting node P\n")
|
|
print_tree(n1)
|