blob: 02833a50f5cacee7f690eeb5d02f70d9d7c497fc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
Node = Struct.new(:value, :left, :right, keyword_init: true) do
def to_s
"(#{value},#{left},#{right})"
end
end
tree = Node.new(
value: 'A',
left: Node.new(value: 'B'),
right: Node.new(
value: 'C',
left: Node.new(value: 'D'),
right: Node.new(value: 'E')
)
)
def pre_order(node)
return if node.nil?
print("#{node.value}")
pre_order(node.left)
pre_order(node.right)
end
def in_order(node)
return if node.nil?
in_order(node.left)
print("#{node.value}")
in_order(node.right)
end
def post_order(node)
return if node.nil?
post_order(node.left)
post_order(node.right)
print("#{node.value}")
end
def level_order(node)
q = []
q.unshift(node)
until q.empty?
node = q.shift
next unless node
print("#{node.value}")
q.unshift(node.left)
q.unshift(node.right)
end
end
puts "Tree: #{tree}"
print "DFS"
print "\n\tpre-order: "
pre_order(tree)
print "\n\tin-order: "
in_order(tree)
print "\n\tpost-order: "
post_order(tree)
puts
print "BFS"
print "\n\tlevel-order: "
level_order(tree)
puts
|
