---
title: "Discussion on \"Height of a Binary Tree - Max Depth\" | Hashnode"
description: "Discussion on \"Height of a Binary Tree - Max Depth\". Problem\nGiven the root of a binary tree, return its maximum depth.\nA binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. (link)\nExample 1:\n\nInput: root = [3,9,20,null,null,15,7]..."
url: "https://hashnode.com/posts/height-of-a-binary-tree-max-depth/66f1902a5da9e24777152e21"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Height of a Binary Tree - Max Depth](https://chetan77.hashnode.dev/height-of-a-binary-tree-max-depth?utm_source=hashnode&utm_medium=feed)

Problem Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. (link) Example 1: Input: root = \[3,9,20,null,null,15,7\]...

Sep 23, 2024 · 2 min read · chetan77.hashnode.dev  
Read the article

-   [#height-of-a-binary-tree](https://hashnode.com/tag/height-of-a-binary-tree)
-   [#maximum-depth-of-a-binary-tree](https://hashnode.com/tag/maximum-depth-of-a-binary-tree)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#binarytrees](https://hashnode.com/tag/binarytrees)
-   [#trees](https://hashnode.com/tag/trees)
-   [#dfs](https://hashnode.com/tag/dfs)
-   [#bfs](https://hashnode.com/tag/bfs)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

  
[View profile](https://hashnode.com/@chetan77)

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.