剑指offer -- 二叉树的深度Java

题目描述

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

解题思路

二叉树的层次遍历 的 变型题。

package binarytree;

import java.util.LinkedList;
import java.util.Queue;

public class MyTreeDepth {
	public int TreeDepth(TreeNode root) {
		if (root == null) {
			return 0;
		}
		int depth = 0;
		Queue<TreeNode> queue = new LinkedList<TreeNode>();
		queue.add(root);
		while(!queue.isEmpty()) {
			int count = queue.size();
			for (int i = 0;i < count;i++) {
				TreeNode first = queue.poll();
				if (first.left != null) {
					queue.add(first.left);
				}
				if (first.right != null) {
					queue.add(first.right);
				}
			}
			depth++;
		}
		return depth;
	}
	public static void main(String[] args) {
		/*        
   	  *              5
   	  *            /   \
   	  *           4     6
   	  *          / \   / \ 
   	  *         12    13  6
   	  *        / \       / \  
   	  *       9   1     5   1
   	  *     
   	  */
		TreeNode a = new TreeNode(5);
		TreeNode b = new TreeNode(4);
		TreeNode c = new TreeNode(6);
		TreeNode d = new TreeNode(12);
		TreeNode e = new TreeNode(13);
		TreeNode f = new TreeNode(6);
		TreeNode g = new TreeNode(9);
		TreeNode h = new TreeNode(1);
		TreeNode i = new TreeNode(5);
		TreeNode j = new TreeNode(1);
		a.left = b;
		a.right = c;
		b.left = d;
		c.left = e;
		c.right = f;
		d.left = g;
		d.right = h;
		f.left = i;
		f.right = j;
		MyTreeDepth m = new MyTreeDepth();
		System.out.println(m.TreeDepth(a));
	}
}