How to find height or maximum depth of binary of binary tree ?

1.54K viewsProgrammingalgorithms binarytree depth height max
0

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.

Answered question
0

Diameter of binary tree

You might also be interested in reading this as the above problem is a subset of this:-

https://www.golibrary.co/finding-diameter-of-a-binary-tree/

Changed status to publish
You are viewing 1 out of 2 answers, click here to view all answers.
Write your answer.

Categories