fn inner_init_from_sorted_list(&mut self, mut head: AVLNodePtr, count: usize) {
        self.count = count;
        unsafe {
            self.root.node = self.recursive_build_from_sorted_list(
                &mut head as *mut AVLNodePtr,
                0,
                count as isize,
            );
        }
    }
/// recursive build AVL from a sorted list which does not contain duplicate keys.
recursive build AVL from a sorted list which does not contain duplicate keys.
recursive build AVL from a sorted list which does not contain duplicate keys .
fn inner_init_from_sorted_list(&mut self, mut head: AVLNodePtr, count: usize) {
        self.count = count;
        unsafe {
            self.root.node = self.recursive_build_from_sorted_list(
                &mut head as *mut AVLNodePtr,
                0,
                count as isize,
            );
        }
    }
fn inner_init_from_sorted_list ( & mut self , mut head : AVLNodePtr , count : usize ) { self . count = count ; unsafe { self . root . node = self . recursive_build_from_sorted_list ( & mut head as * mut AVLNodePtr , 0 , count as isize , ) ; } }
recursive build AVL from a sorted list which does not contain duplicate keys.
recursive build AVL from a sorted list which does not contain duplicate keys .
&mut self
head
AVLNodePtr
count
usize