Files
hello-algo/en/codes/ruby/chapter_tree/binary_tree.rb
Yudong Jin 14c314c08c Retranslate the complete English edition from Simplified Chinese (#2010)
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
2026-10-31 03:35:51 +08:00

39 lines
840 B
Ruby

=begin
File: binary_tree.rb
Created Time: 2024-04-18
Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
=end
require_relative '../utils/tree_node'
require_relative '../utils/print_util'
### Driver code ###
if __FILE__ == $0
# Initialize the binary tree
# Initialize the nodes
n1 = TreeNode.new(1)
n2 = TreeNode.new(2)
n3 = TreeNode.new(3)
n4 = TreeNode.new(4)
n5 = TreeNode.new(5)
# Set up references (pointers) between the nodes
n1.left = n2
n1.right = n3
n2.left = n4
n2.right = n5
puts "\nInitialize the binary tree\n\n"
print_tree(n1)
# Insert and remove nodes
_p = TreeNode.new(0)
# Insert node _p between n1 and n2
n1.left = _p
_p.left = n2
puts "\nAfter inserting node _p\n\n"
print_tree(n1)
# Remove a node
n1.left = n2
puts "\nAfter removing node _p\n\n"
print_tree(n1)
end