Maximum Depth of Binary Tree

Maximum Depth of Binary TreeTotal accepted:107337 Total submissions:231121 difficulty:easy

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.

Finding the height of trees

/** Definition for a binary tree node. * struct TreeNode {* int val; * TreeNode *left; * TreeNode *right; * TreeNode (int x): Val (x), left (null), right (NULL) {} *}; */classSolution { Public:    intMaxDepth (treenode*root) {        if(Root==null)return 0; intLH = maxDepth (root->Left ); intRH = MaxDepth (root->Right ); returnLh>rh? lh+1: rh+1; }};

Next challenges: (E) Minimum Depth of Binary Tree

Maximum Depth of Binary Tree