Binary Indexed Trees (BITs)

Made by Romania, posted in Computer Science, on August 14, 2012 1:41 am

Operational objectives:
Students must be able to:
O1: define a binary indexed tree
O2: identify a binary indexed tree
O3: correctly use theoretical concepts learned
O4: acquire algorithms for different
operations (both modification and query)
O5: correctly analyze each problem and to write the properly program/sub-program

This material rate is 0 of 5 points from 0 votes.

(223)