Sunday, May 3, 2020

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 down to the farthest leaf node.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.

Solution:

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Check If It Is a Straight Line

You are given an array  coordinates ,  coordinates[i] = [x, y] , where  [x, y]  represents the coordinate of a point. Check if these points ...

  • Leftmost Column with at Least a One
    A binary matrix means that all elements are  0  or  1 . For each  individual  row of the matrix, this row is sorted in non-decreasing order....
  • Cousins in Binary Tree
    In a binary tree, the root node is at depth  0 , and children of each depth  k  node are at depth  k+1 . Two nodes of a binary tree are  cou...
  • Check If It Is a Straight Line
    You are given an array  coordinates ,  coordinates[i] = [x, y] , where  [x, y]  represents the coordinate of a point. Check if these points ...