leetcode 222. Count Complete Tree Nodes
来源：互联网 发布：软件维护工程师 编辑：程序博客网 时间：2024/06/04 21:12
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def countNodes(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 l = root r = root LeftLength = 0 RightLength = 0 while l is not None: l = l.left LeftLength += 1 while r is not None: r = r.right RightLength += 1 if LeftLength == RightLength: return 2 ** LeftLength - 1 else: return 1+self.countNodes(root.left)+self.countNodes(root.right)
阅读全文
0 0
- [leetcode] 222.Count Complete Tree Nodes
- [leetcode] 222. Count Complete Tree Nodes
- 222. Count Complete Tree Nodes LeetCode
- leetcode 222. Count Complete Tree Nodes
- LeetCode *** 222. Count Complete Tree Nodes
- LeetCode 222. Count Complete Tree Nodes
- leetcode.222. Count Complete Tree Nodes
- [leetcode]222. Count Complete Tree Nodes
- [leetcode] 222. Count Complete Tree Nodes
- 222. Count Complete Tree Nodes(leetcode) 超时
- [LeetCode]222. Count Complete Tree Nodes
- (未完成！)Leetcode 222. Count Complete Tree Nodes
- LeetCode 222. Count Complete Tree Nodes
- [LeetCode]222. Count Complete Tree Nodes
- [leetcode]222. Count Complete Tree Nodes
- leetcode 222. Count Complete Tree Nodes
- leetcode 222. Count Complete Tree Nodes
- [LeetCode] Count Complete Tree Nodes
- Sensor sc2235 Porting
- hdu6112 今夕何夕
- Android系统堆内存限制浅析
- HDU
- Web应用程序简介
- leetcode 222. Count Complete Tree Nodes
- MYSQL 最近知识总结（5）
- C++的基础知识（三）--STL基础
- UriMatcher类使用介绍
- 经典实例
- KMP两种写法以及AC自动机失配数组间的区别
- maven 创建多模块备忘(1)之搭建结构
- MySQL执行计划 EXPLAIN查询解释
- 网络管理（一）
