---
title: "Discussion on \"LeetCode 104: Maximum Depth Of Binary Tree — Step-by-Step Visual Trace\" | Hashnode"
description: "Discussion on \"LeetCode 104: Maximum Depth Of Binary Tree — Step-by-Step Visual Trace\". Given the root of a binary tree, return 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."
url: "https://hashnode.com/posts/maximum-depth-of-binary-tree-visualization/69d7d24bb3157a36ebc026d2"
---

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

Discussion

# [LeetCode 104: Maximum Depth Of Binary Tree — Step-by-Step Visual Trace](https://blog.tracelit.dev/maximum-depth-of-binary-tree-visualization?utm_source=hashnode&utm_medium=feed)

Given the root of a binary tree, return 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.

Apr 9 · 1 min read · blog.tracelit.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#binary-tree](https://hashnode.com/tag/binary-tree)
-   [#leetcode](https://hashnode.com/tag/leetcode)

## Written by

[tracelit](https://hashnode.com/@tracelit)

@tracelit

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
