Patent ID: 8370115

Claim:
A method, comprising: determining, by a processor system, a first modified cost measure for a node of a binary tree, the first modified cost measure comprising at least three cost values, the node in an original condition, wherein the at least three cost values of the first modified cost measure are determined from at least three cost values of a price-tag associated with the node in the original condition; pivoting, by the processor system, the node; determining, by the processor system, a second modified cost measure for the node in a pivoted condition, the second modified cost measure comprising at least three cost values; determining, by the processor system, a preferred node condition responsive to a comparison of the first and second cost measures; placing, the processor system, each node of the binary tree in a referred node condition in a bottom-up fashion based upon a depth of the node; and implementing a blist circuit based upon the binary tree with all nodes in the preferred node condition.