coding/tree.rb at master · workatbest/coding · GitHub

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
class TreeNode
    attr_accessor :left, :right, :data

    def initialize(data)
        @data = data
        @left = nil
        @right = nil
    end
end

def add_binary(a, n)
  new_node = TreeNode.new(n)
  return new_node unless a

end

def inorder(a)
  return unless a
  inorder(a.left)
  p a.data
  inorder(a.right)
end

def preorder(a)
  return unless a
  p a.data
  preorder(a.left)
  preorder(a.right)
end

def postorder(a)
  return unless a
  postorder(a.left)
  postorder(a.right)
  p a.data
end

def maxDefth(a)
    return 0 unless a
    l = maxDefth(a.left) + 1
    r = maxDefth(a.right) + 1
    return [l, r].max + 1
end


a = TreeNode.new(4)
a.left = TreeNode.new(2)
a.left.left = TreeNode.new(1)
a.left.right = TreeNode.new(3)
a.right = TreeNode.new(6)
a.right.left = TreeNode.new(5)
a.right.right = TreeNode.new(8)
a.right.right.left = TreeNode.new(7)
inorder(a)
preorder(a)
postorder(a)
p "Defth"
p maxDefth(a)