Saturday, July 20, 2013

Maximum depth of binary tree@leetcode

微博：http://www.weibo.com/cathyhwzn

刷题必备书籍：Cracking the Coding Interview: 150 Programming Questions and Solutions
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.
简单题，就是递归然后计算长度，但是要用queue来存储暂时的node。和上几题思路都是一样的，还是 BFS. 
By -
Labels: , , ,

2 comments:

  1. UnknownSeptember 17, 2013 at 2:00 AM

    Hi,

    I am struggling on this question. Do you know how to solve it using dfs in an iterative way?

    Thanks
    Terry

    ReplyDelete
    Replies
    1. codingcatJune 12, 2014 at 10:07 PM

      Hi, I don't think it's suitable here to use DFS.

      Delete

Subscribe to: Post Comments (Atom)

Leetcode 316. Remove Duplicate Letters

 这道题表面问的是如何删除重复，实际在问如何从多个字符选取一个保留，从而让整个字符串按升序排列。那么策略就是对于高顺位的字符比如‘a'，就要选靠前位置的保留，而低顺位字符如’z'则应该尽量选取靠后位置保留。 算法大概思路：每看到一个字符，我们要决定是否保留 1. ...

  • zz. 面试总结 from peking2
    首先声明一下，这里的面试题主要所指数据结构和算法的题目，题目的分析集中在Leetcode上面的题目上。 我认为一道面试题由以下几个方面组成的 Question Data structure in question Data structure in solutio...
  • Copy Books @Lintcode
    Given an array A of integer with size of n( means n books and number of pages of each book) and k people to copy the book. You must distribu...
  • Leetcode 1166 @ Design System Files
    1166. Design File System Medium 62 4 Add to List Share You are asked to design a file system which provides two functions: crea...