刷題-- 平衡二叉樹

輸入一棵二叉樹，判斷該二叉樹是不是平衡二叉樹。python 基本思想：遞歸。web # -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def Depth(self, pR

>>阅读原文<<