print_wise_binary_tree.cpp

#include <iostream>
#include <queue>



using namespace std;

template <typename T>
class BinaryTreeNode {
   public:
    T data;
    BinaryTreeNode<T>* left;
    BinaryTreeNode<T>* right;

    BinaryTreeNode(T data) {
        this->data = data;
        left = NULL;
        right = NULL;
    }
};

void printLevelWise(BinaryTreeNode<int> *root)
{
    if(root == NULL)
    {
        return;
    }
	
	queue<BinaryTreeNode<int> *>temp;
    
    temp.push(root);
    
    while(temp.size()!=0)
    {
        BinaryTreeNode<int>*temp_one = temp.front();
        temp.pop();
        cout<<temp_one->data<<":";
        
        if(temp_one->left!=NULL)
        {
          temp.push(temp_one->left);
      	  cout<<"L:"<<temp_one->left->data<<",";
        }
        else
        {
            cout<<"L:"<<-1<<",";
        }
        if(temp_one->right!=NULL)
        {
          temp.push(temp_one->right);
      	  cout<<"R:"<<temp_one->right->data;
        }
        else
        {
            cout<<"R:"<<-1;
        }
        
      	cout<<endl;
    }
}




BinaryTreeNode<int>* takeInput() {
    int rootData;

    cin >> rootData;
    if (rootData == -1) {
        return NULL;
    }
    BinaryTreeNode<int>* root = new BinaryTreeNode<int>(rootData);
    queue<BinaryTreeNode<int>*> q;
    q.push(root);
    while (!q.empty()) {
        BinaryTreeNode<int>* currentNode = q.front();
        q.pop();
        int leftChild, rightChild;

        cin >> leftChild;
        if (leftChild != -1) {
            BinaryTreeNode<int>* leftNode = new BinaryTreeNode<int>(leftChild);
            currentNode->left = leftNode;
            q.push(leftNode);
        }

        cin >> rightChild;
        if (rightChild != -1) {
            BinaryTreeNode<int>* rightNode =
                new BinaryTreeNode<int>(rightChild);
            currentNode->right = rightNode;
            q.push(rightNode);
        }
    }
    return root;
}

int main() {
    BinaryTreeNode<int>* root = takeInput();
     printLevelWise(root);
}