"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
# @param {TreeNode} root the root of binary tree
# @return {TreeNode} the max node
def maxNode(self, root):
# Write your code here
if root == None:
return None
left = self.maxNode(root.left)
right = self.maxNode(root.right)
return self.max(root, self.max(left, right))
def max(self, left, right):
if left == None:
return right
if right == None:
return left
if left.val > right.val:
return left
else:
return right
Python, LintCode, 632. 二叉树的最大节点
最新推荐文章于 2020-02-03 11:14:54 发布