In this paper we study the balance matrix that gives the order of balance of any binary word. In addition, we define for Christoffel words a new matrix called second order balance matrix. This matrix gives more information on the balance property of a word that codes the number of occurrences of the letter 1 in successive blocks of the same length for the studied Christoffel word. By taking the maximum of the Second order balance matrix we define the second order of balance and we are able to order the Christoffel words according to these values. Our construction uses extensively the continued fraction associated with the slope of each Christoffel word, and we prove a recursive formula based on fine properties of the Stern-Brocot tree to construct second order matrices. Finally, we show that an infinite path on the Stern-Brocot tree, which minimizes the second order of balance is given by a path associated with the Fibonacci word.