docstr: Constructs and returns a Binary Indexed Tree for given array of size n. 
docstr_tok: ["Constructs","and","returns","a","Binary","Indexed","Tree","for","given","array","of","size","n","."]
code: def construct(self):
      """
      Constructs and returns a Binary Indexed Tree for given array of size n.
      """
  
      # Create and initialize bit_ree[] as 0
      bit_tree = [0] * (self.n + 1)
  
      # Store the actual values in bit_ree[] using update()
      for i in range(self.n):
          self.update_bit(bit_tree, i, self.arr[i])
  
      return bit_tree
  
label_desc: Use image node_id 4 for calling the Fenwick_Tree obj's underlying member method code with example usage: obj.construct() and returns: bit_tree