LeetCode/104_MaxDepthOfBinaryTree.py at master · Shinnnyshinshin/LeetCode · 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#-------------------------------------------------------------------------------
#
#-------------------------------------------------------------------------------
# By Will Shin
#
#-------------------------------------------------------------------------------
#    LeetCode prompt
#-------------------------------------------------------------------------------

"""
Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.


# Ok so this is one?


"""
# #
#-------------------------------------------------------------------------------
#    Approach
#-------------------------------------------------------------------------------

"""

* this is  traversal that counts as we go down? Let's see if we

"""

#-------------------------------------------------------------------------------
#    Solution
#-------------------------------------------------------------------------------
def my_maxDepth(node):
    if node is None:
        return 0
    returned = 1 + max(my_maxDepth(node.left), my_maxDepth(node.right))
    return returned


#-------------------------------------------------------------------------------
#    Main Leetcode Input Driver
#-------------------------------------------------------------------------------
class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None


import unittest
from mymodules import BinaryTree as bt
class Solution:
    def maxDepth(self, root):
        return my_maxDepth(root)
#-------------------------------------------------------------------------------
#    Unit Test
#-------------------------------------------------------------------------------


class TestSolution(unittest.TestCase):
    def test_solution(self):
        test_tree = bt.Tree()
        test_tree.insert(10)
        test_tree.insert(5)
        test_tree.insert(1)
        test_tree.insert(6)
        test_tree.insert(15)
        test_tree.insert(11)
        test_tree.insert(18)
        test_tree.printtree(test_tree.root)
        self.assertEquals(Solution().maxDepth(test_tree.root),3)

unittest.main()