public Huffman.BinaryTree DequeueData() { Huffman.BinaryTree tree = Trees[0]; Trees.RemoveAt(0); MoveLastItemToFirst(); MoveDown(0); return(tree); }
public void Enqueue(Huffman.BinaryTree tree) { Trees.Add(tree); MinHeapify(Trees.Count - 1); }
public Huffman.BinaryTree DequeueData() { Huffman.BinaryTree tree = Trees[0]; Trees.RemoveAt(0); MoveLastItemToFirst(); MoveDown(0); return(tree); }
public void Enqueue(Huffman.BinaryTree tree) { Trees.Add(tree); MinHeapify(Trees.Count - 1); }