display.cpp

#include <iostream>
#include <queue>
#ifndef NODE_H
#include "B+ Tree.h"


void BPTree::display(Node* cursor) {
    /*
		Depth First Display

    if (cursor != NULL) {
        for (int i = 0; i < cursor->keys.size(); i++)
            cout << cursor->keys[i] << " ";
        cout << endl;
        if (cursor->isLeaf != true) {
            for (int i = 0; i < cursor->ptr2TreeOrData.ptr2Tree.size(); i++)
                display(cursor->ptr2TreeOrData.ptr2Tree[i]);
        }
    }
    */

    /*
        Level Order Display
    */
    if (cursor == NULL) 
	{
		cout<<"No Data in the Database yet!\n";
		return;
	}
    queue<Node*> q;
    q.push(cursor);
	if(q.empty())
	{
		cout<<"No Data in the Database yet!\n";
		return;
	};
	cout << "\nHere is your File Structure" << endl;
    while (!q.empty()) {
        int sz = q.size();
        for (int i = 0; i < sz; i++) {
            Node* u = q.front(); q.pop();

            //printing keys in self
            for (int val : u->keys)
                cout << val << " ";

            cout << "|| ";//to seperate next adjacent nodes
            
            if (u->isLeaf != true) {
                for (Node* v : u->ptr2TreeOrData.ptr2Tree) {
                    q.push(v);
                }
            }
        }
        cout << endl;
    }
}

void BPTree::seqDisplay(Node* cursor) {
	if (cursor == NULL) 
	{
		cout<<"No Data in the Database yet!\n";
		return;
	}
    Node* firstLeft = firstLeftNode(cursor);

    if (firstLeft == NULL) {
        cout << "No Data in the Database yet!" << endl;
        return;
    }
	cout << "\nHere is your File Structure" << endl;
    while (firstLeft != NULL) {
        for (int i = 0; i < firstLeft->keys.size(); i++) {
            cout << firstLeft->keys[i] << " ";
        }

        firstLeft = firstLeft->ptr2next;
    }
    cout << endl;
}

#endif