"Leetcode-Interview algorithm classic-java Implementation" "104-maximum Depth of binary tree (maximum depth of binary trees)"

"104-maximum Depth of binary tree (maximum depth of binary trees)" "leetcode-Interview algorithm classic-java Implementation" "All topics Directory Index" Original Question

Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along, the longest path from the root node to the farthest leaf node.

Main Topic

Given a two-pronged tree, ask for its maximum depth.

Thinking of solving problems

Recursive solution, recursive formula
F (n) = 0; N=null,
F (n) = 1+ max (f (n left), F (n right))

Code Implementation

Tree Node class

publicclass TreeNode {    int val;    TreeNode left;    TreeNode right;    TreeNode(int x) {        val = x;    }}

Algorithm implementation class

 Public classSolution { Public intMaxDepth (TreeNode root) {if(Root = =NULL) {return0; }Else if(Root. Left==NULL&& Root. Right==NULL) {return1; }Else{int  Left= MaxDepth (root. Left);int  Right= MaxDepth (root. Right); Return1+ ( Left> Right? Left: Right); }    }}

Evaluation Results

　　Click on the picture, the mouse does not release, drag a position, release after the new window to view the full picture.

Special Instructions Welcome reprint, Reprint please indicate the source "http://blog.csdn.net/derrantcm/article/details/47354355"

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

"Leetcode-Interview algorithm classic-java Implementation" "104-maximum Depth of binary tree (maximum depth of binary trees)"