LeetCode--计算树的最小深度

Problem：

https://leetcode.com/problems/minimum-depth-of-binary-tree/description/

思路分析：

该题目对应最大深度，树的最大深度求解思路一般是求解树的左右子树深度，然后取最大值+1（+1因为根的存在），最小深度考虑一边子树不存在时的最小深度即为最大深度。

Solution：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root == None:
            return 0
        
        lminDepth = Solution.minDepth(self, root.left)
        
        rminDepth = Solution.minDepth(self, root.right)
        if root.left == None or root.right == None:
            return max(lminDepth, rminDepth)+1
        else:
            return min(lminDepth, rminDepth)+1

def stringToTreeNode(input):
    input = input.strip()
    input = input[1:-1]
    if not input:
        return None

    inputValues = [s.strip() for s in input.split(',')]
    root = TreeNode(int(inputValues[0]))
    nodeQueue = [root]
    front = 0
    index = 1
    while index < len(inputValues):
        node = nodeQueue[front]
        front = front + 1

        item = inputValues[index]
        index = index + 1
        if item != "null":
            leftNumber = int(item)
            node.left = TreeNode(leftNumber)
            nodeQueue.append(node.left)

        if index >= len(inputValues):
            break

        item = inputValues[index]
        index = index + 1
        if item != "null":
            rightNumber = int(item)
            node.right = TreeNode(rightNumber)
            nodeQueue.append(node.right)
    return root

def main():
    import sys
    def readlines():
        for line in sys.stdin:
            yield line.strip('\n')

    lines = readlines()
    while True:
        try:
            line = next(lines)
            root = stringToTreeNode(line);
            
            ret = Solution().minDepth(root)

            out = str(ret);
            print(out)
        except StopIteration:
            break

if __name__ == '__main__':
    main()