Dictionary-using-binary-trees/BST.h at main · mmohamedkhaled/Dictionary-using-binary-trees · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#ifndef BST_H
#define BST_H
#include <string>

template <typename Key, typename Data>
class BST
{
public:
    template <typename K, typename D>

    class TreeNode
    {
    public:
        K key;
        D data;
        TreeNode<K, D> *left;
        TreeNode<K, D> *right;
        TreeNode(K p_key, D p_data) : key(p_key), data(p_data), left(nullptr), right(nullptr) {}
    };
    BST();
    ~BST();
    void delete_tree(TreeNode<Key, Data> *r);
    bool insert(const Key &p_key, const Data &p_data);
    bool empty(TreeNode<Key, Data> *&root) const;
    bool search(Key key);
    bool retrieve(Key p_key, Data &p_data);
    void remove(Key p_key);
    int traverse(int determine);
    void preorder();
    void levelorder();
    void traverse_to_screen(std::ofstream &outStream);
    void levelorder_to_screen(std::ofstream &outStream);

    TreeNode<Key, Data> *getroot();
    // void reverse_traverse_to_screen(ofstream &outStream);
private:
    TreeNode<Key, Data> *root;
    bool insert_master(TreeNode<Key, Data> *&r, const Key &p_key, const Data &p_data);
    bool search_master(TreeNode<Key, Data> *&r, Key p_key);
    bool retrieve_master(TreeNode<Key, Data> *&r, Key p_key, Data &p_data);
    int traverse_master(TreeNode<Key, Data> *&r, int determine, int &count);
    void levelorder_master(TreeNode<Key, Data> *&r);
    void preorder_master(TreeNode<Key, Data> *&r);
    void remove_master(TreeNode<Key, Data> *&r, Key p_key);
    void traverse_master_to_screen(TreeNode<Key, Data> *&r, std::ofstream &outStream);
    void levelorder_master_to_screen(TreeNode<Key, Data> *&r,std:: ofstream &outStream);
    // void reverse_traverse_master_to_screen(TreeNode<Key, Data> *&r, std:: ofstream &outStream);

};

#include "BST.cpp"
#endif // BST_H