mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 14:16:29 +08:00
3f4220de81
* preorder, inorder, postorder -> pre-order, in-order, post-order * Bug fixes * Bug fixes * Update what_is_dsa.md * Sync zh and zh-hant versions * Sync zh and zh-hant versions. * Update performance_evaluation.md and time_complexity.md * Add @khoaxuantu to the landing page. * Sync zh and zh-hant versions * Add @ khoaxuantu to the landing page of zh-hant and en versions.
46 lines
1.2 KiB
Ruby
46 lines
1.2 KiB
Ruby
=begin
|
|
File: build_tree.rb
|
|
Created Time: 2024-05-13
|
|
Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
|
|
=end
|
|
|
|
require_relative '../utils/tree_node'
|
|
require_relative '../utils/print_util'
|
|
|
|
### 構建二元樹：分治 ###
|
|
def dfs(preorder, inorder_map, i, l, r)
|
|
# 子樹區間為空時終止
|
|
return if r - l < 0
|
|
|
|
# 初始化根節點
|
|
root = TreeNode.new(preorder[i])
|
|
# 查詢 m ，從而劃分左右子樹
|
|
m = inorder_map[preorder[i]]
|
|
# 子問題：構建左子樹
|
|
root.left = dfs(preorder, inorder_map, i + 1, l, m - 1)
|
|
# 子問題：構建右子樹
|
|
root.right = dfs(preorder, inorder_map, i + 1 + m - l, m + 1, r)
|
|
|
|
# 返回根節點
|
|
root
|
|
end
|
|
|
|
### 構建二元樹 ###
|
|
def build_tree(preorder, inorder)
|
|
# 初始化雜湊表，儲存 inorder 元素到索引的對映
|
|
inorder_map = {}
|
|
inorder.each_with_index { |val, i| inorder_map[val] = i }
|
|
dfs(preorder, inorder_map, 0, 0, inorder.length - 1)
|
|
end
|
|
|
|
### Driver Code ###
|
|
if __FILE__ == $0
|
|
preorder = [3, 9, 2, 1, 7]
|
|
inorder = [9, 3, 1, 2, 7]
|
|
puts "前序走訪 = #{preorder}"
|
|
puts "中序走訪 = #{inorder}"
|
|
|
|
root = build_tree(preorder, inorder)
|
|
puts "構建的二元樹為："
|
|
print_tree(root)
|
|
end
|