---
title: "Discussion on \"Fenwick Trees in Embedded Systems: When to Use Them (and When Not To)\" | Hashnode"
description: "Discussion on \"Fenwick Trees in Embedded Systems: When to Use Them (and When Not To)\". A Fenwick Tree (also called a Binary Indexed Tree) is a data structure that efficiently supports prefix sum queries and point updates in O(log n) time using minimal memory. It’s widely used in scenarios where cumulative sums are updated frequently an..."
url: "https://hashnode.com/posts/fenwick-trees-in-embedded-systems-when-to-use-them-and-when-not-to/68a73c813bbf12346853dd42"
---

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

Discussion

# [Fenwick Trees in Embedded Systems: When to Use Them (and When Not To)](https://technestan.hashnode.dev/fenwick-trees-in-embedded-systems-when-to-use-them-and-when-not-to?utm_source=hashnode&utm_medium=feed)

A Fenwick Tree (also called a Binary Indexed Tree) is a data structure that efficiently supports prefix sum queries and point updates in O(log n) time using minimal memory. It’s widely used in scenarios where cumulative sums are updated frequently an...

Aug 21, 2025 · 7 min read · technestan.hashnode.dev  
Read the article

-   [#embedded-systems](https://hashnode.com/tag/embedded-systems)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Abdul Rehman](https://hashnode.com/@supermind2002)

@supermind2002

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

I love to play with new technologies

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
