-
Notifications
You must be signed in to change notification settings - Fork 0
/
forest.lua
67 lines (51 loc) · 1.17 KB
/
forest.lua
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
forest = {}
forest.sweeper = {}
function forest.node( value )
return {
left = nil,
right = nil,
value = value
}
end
function forest.tree( root )
return {
root = root
}
end
function forest.insert( root, node )
if root == nil then
return node
end
-- Verificação para permitir que a árvore toda
-- seja inserida
if root.root ~= nil then
root = root.root
end
if root.value > node.value then
root.left = forest.insert(root.left, node)
else
root.right = forest.insert(root.right, node)
end
--[[ Retorna o nó inserido, evitando problemas de ligação
entre os nós da árvore ]]
return root
end
function forest.sweeper.sweep(root, sweeper)
sweeper(root.root, sweeper)
end
-- deep-first
function forest.sweeper.preorder(root)
print( root.value )
if root.left ~= nil then
forest.sweeper.preorder(root.left)
end
if root.right ~= nil then
forest.sweeper.preorder(root.right)
end
end
-- in-order (Simétrico)
function forest.sweeper.inorder(root)
end
function forest.sweeper.posorder(root)
end
return forest