refactor comments and variables to english

headers/huffman.h

@@ -7,35 +7,35 @@
  * After creation, the Huffman Structure are used to encode and decode a text.
 */
 class Huffman {
-    private:
-        No* root; // Node that stores the root of Huffman Structure
-        string encodedString;
-        string decodedString;
-        float compressionRatio;
+  private:
+    Node* root; // Node that stores the root of Huffman Structure
+    string encodedString;
+    string decodedString;
+    float compressionRatio;
 
-    public:
-        Huffman(string);
-        ~Huffman();
-        
-        // Build the structure
-        No* buildHuffman(unordered_map<char, int>);
-        unordered_map<char, int> contaFrequencia(string);
+  public:
+    Huffman(string);
+    ~Huffman();
+
+    // Build the structure
+    Node* buildHuffman(unordered_map<char, int>);
+    unordered_map<char, int> frequencyCount(string);
 
-        // Encode string
-        string encodeString(string);
-        void createHuffmanTable(No*, string, unordered_map<char, string>&);
-       
-        // Decode string
-        string decodeString(string);
-        
-        // Compute compression ratio
-        float computeCompressionRatio(string, string);
-        
-        bool isLeaf(No*);
-        void deleteHuffman(No*);
+    // Encode string
+    string encodeString(string);
+    void createHuffmanTable(Node*, string, unordered_map<char, string>&);
+
+    // Decode string
+    string decodeString(string);
+
+    // Compute compression ratio
+    float computeCompressionRatio(string, string);
+
+    bool isLeaf(Node*);
+    void deleteHuffman(Node*);
 
-        // getters
-        string getEncodedString();
-        string getDecodedString();
-        float getCompressionRatio();
+    // getters
+    string getEncodedString();
+    string getDecodedString();
+    float getCompressionRatio();
 };

headers/minHeap.h

@@ -1,28 +1,27 @@
-#include "no.h"
+#include "node.h"
 #include <unordered_map>
 using namespace std;
 
 class MinHeap{
-    private:
-        int elementsQty; // current size (number of elements)
-        int max; // max size
-        No** pointerArr; // array of pointers of Node type
+  private:
+    int elementsQty; // current size (number of elements)
+    int max; // max size
+    Node** pointerArr; // array of pointers of Node type
 
-    public:
+  public:
+    /*
+      * Build a heap receiving the size, the text and the map structure that stores
+      * occurrence frequency of each character in text
+    */
+    MinHeap(unordered_map<char, int>);
+
+    // Due dinamic array alocation, exists a destructor to desalocate memory
+    ~MinHeap();
 
-        /*
-         * Build a heap receiving the size, the text and the map structure that stores
-         * occurrence frequency of each character in text
-        */
-        MinHeap(unordered_map<char, int>);
-
-        // Due dinamic array alocation, exists a destructor to desalocate memory
-        ~MinHeap();
-
-        void goUp(int);
-        void goDown(int);
-        void buildHeap();
-        void insert(No*);
-        No* removeMin();
-        bool isLeaf(No*);
+    void goUp(int);
+    void goDown(int);
+    void buildHeap();
+    void insert(Node*);
+    Node* removeMin();
+    bool isLeaf(Node*);
 };

headers/node.h

@@ -0,0 +1,24 @@
+// Definition of Node strucutre used in MinHeap and Huffman tree structures.
+class Node {
+  private:
+    char info; // character
+    int freq;  // character frequency
+    Node* left;
+    Node* right;
+
+  public:
+    Node(char, int);
+    Node();
+
+    // setters
+    void setInfo(char);
+    void setFreq(int);
+    void setLeft(Node*);
+    void setRight(Node*);
+
+    // getters
+    char getInfo();
+    int getFreq();
+    Node* getLeft();
+    Node* getRight();
+};