fn free_leaves(&self) -> Vec<LeafIndex> {
        let mut free_leaves = vec![];
        for i in 0..self.leaf_count().as_usize() {
            // TODO use an iterator instead
            let leaf_index = LeafIndex::from(i);
            if self.nodes[leaf_index].is_blank() {
                free_leaves.push(leaf_index);
            }
        }
        free_leaves
    }
/// Returns the list of blank leaves within the tree
Returns the list of blank leaves within the tree
Returns the list of blank leaves within the tree
fn free_leaves(&self) -> Vec<LeafIndex> {
        let mut free_leaves = vec![];
        for i in 0..self.leaf_count().as_usize() {
            // TODO use an iterator instead
            let leaf_index = LeafIndex::from(i);
            if self.nodes[leaf_index].is_blank() {
                free_leaves.push(leaf_index);
            }
        }
        free_leaves
    }
fn free_leaves ( & self ) -> Vec < LeafIndex > { let mut free_leaves = vec ! [ ] ; for i in 0 .. self . leaf_count ( ) . as_usize ( ) { // TODO use an iterator instead let leaf_index = LeafIndex :: from ( i ) ; if self . nodes [ leaf_index ] . is_blank ( ) { free_leaves . push ( leaf_index ) ; } } free_leaves }
Returns the list of blank leaves within the tree
Returns the list of blank leaves within the tree
&self
&self