---
title: "Discussion on \"Finding the Smallest Subtree Containing All Deepest Nodes\" | Hashnode"
description: "Discussion on \"Finding the Smallest Subtree Containing All Deepest Nodes\". Discover how to find the smallest subtree containing all deepest nodes in a binary tree using a Rust implementation"
url: "https://hashnode.com/posts/finding-the-smallest-subtree-containing-all-deepest-nodes/6960d0abe179a29cc29eec7c"
---

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

Discussion

# [Finding the Smallest Subtree Containing All Deepest Nodes](https://mahmudsudo.hashnode.dev/finding-the-smallest-subtree-containing-all-deepest-nodes?utm_source=hashnode&utm_medium=feed)

Discover how to find the smallest subtree containing all deepest nodes in a binary tree using a Rust implementation

Jan 9 · 3 min read · mahmudsudo.hashnode.dev  
Read the article

-   [#devops](https://hashnode.com/tag/devops)
-   [#dsainrust](https://hashnode.com/tag/dsainrust)

## Written by

[Bello Mahmud](https://hashnode.com/@Mahmudsudo)

@Mahmudsudo · Nigeria

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

Algorithm , web , software engineering, robotics and AI

I am a nerdy software engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.