×
Home Discussions Write at Opengenus IQ
×
  • Home
  • Write at OpenGenus IQ
  • Discussions

Yash Aggarwal

2 posts •
data structure

Fenwick Tree (Binary Indexed Tree)

Fenwick Tree / Binary indexed tree (BIT) is a data structure used to process interval/range based queries. Compared to segment tree data structure, Fenwick tree uses less space and is simpler to implement. One disadvantage is that it can be only used with an operation that is invertible.

Yash Aggarwal
data structure

Segment Tree

A segment tree is a divide and conquer based data structure used to store information about intervals of some linear data structure. It is a height-balanced binary tree where every node corresponds to an interval of the array. It allows processing interval or range queries in logarithmic time

Yash Aggarwal
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2019 All rights reserved ™
Top Posts Twitter