leetcode之十Maximum Depth of Binary Tree

copyright:leetcode

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.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
		return recurBFS(root);
    }
	private int recurBFS(TreeNode tNode){
		if(tNode == null)
			return 0;
		else {
			int left = recurBFS(tNode.left), right = recurBFS(tNode.right);
			if(left > right)
				return left + 1;
			else
				return right + 1;
		}
	
	}
}

递归，二叉树宽度优先遍历