104. Maximum Depth of Binary Tree

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.

Subscribe to see which companies asked this question

Calculate the depth of a binary tree

Java (3ms): BFS

1 /**2 * Definition for a binary tree node.3 * public class TreeNode {4 * int val;5 * TreeNode left;6 * TreeNode right;7 * TreeNode (int x) {val = x;}8  * }9  */Ten  Public classSolution { One      Public intmaxDepth (TreeNode root) { A         if(Root = =NULL) -             return0 ; -         intDepth = 0 ; theTreeNode node =NULL ; -Queue<treenode> que =NewLinkedlist<treenode>() ; - Que.offer (root); -          while(!Que.isempty ()) { +             intSize =que.size (); -              for(inti = 0; i < size; i++){ +node =Que.poll (); A                 if(Node.left! =NULL){ at Que.offer (node.left); -                 } -                 if(Node.right! =NULL){ - Que.offer (node.right); -                 } -                  in             } -depth++ ; to         } +         returndepth; -     } the}

Java (1ms): DFS

1 /**2 * Definition for a binary tree node.3 * public class TreeNode {4 * int val;5 * TreeNode left;6 * TreeNode right;7 * TreeNode (int x) {val = x;}8  * }9  */Ten  Public classSolution { One      Public intmaxDepth (TreeNode root) { A         if(Root = =NULL) -             return0 ; -          the         returnMath.max (MaxDepth (Root.left), maxDepth (root.right)) + 1 ; -     } -}

104. Maximum Depth of Binary Tree