---
title: "#height-of-a-binary-tree articles | Hashnode"
description: "Explore 3 articles tagged #height-of-a-binary-tree on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/height-of-a-binary-tree"
---

Tag

# #height-of-a-binary-tree

3 posts · 0 followers

[Chetan Datta](https://hashnode.com/@chetan77) · [Oct 27, 2024](https://hashnode.com/posts/diameter-of-binary-tree/671dc4fc8b6b3efc64cbb928)

### [Diameter of Binary Tree](https://chetan77.hashnode.dev/diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed)

Problem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a p...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Oct 26, 2024](https://hashnode.com/posts/balanced-binary-tree/671d14ed83ca8581476ce16f)

### [Balanced Binary Tree](https://chetan77.hashnode.dev/balanced-binary-tree?utm_source=hashnode&utm_medium=feed)

Problem statement Given a binary tree, determine if it is height-balanced.(link) Example 1: Input: root = \[3,9,20,null,null,15,7\] Output: true Example 2: Input: root = \[1,2,2,3,3,null,null,4,4\] Output: false Example 3: Input: root = \[\] Output: tr...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/balanced-binary-tree?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Sep 23, 2024](https://hashnode.com/posts/height-of-a-binary-tree-max-depth/66f1902a5da9e24777152e21)

### [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\]...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/height-of-a-binary-tree-max-depth?utm_source=hashnode&utm_medium=feed)