#ifndef NODES_LLOLL_H #define NODES_LLOLL_H #include    // for ostream namespace CS3358_SP2023_A5P2

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

#ifndef NODES_LLOLL_H
#define NODES_LLOLL_H

#include <iostream>    // for ostream

namespace CS3358_SP2023_A5P2
{
   // child node
   struct CNode
   {
      int data;
      CNode* link;
   };

   // parent node
   struct PNode
   {
      CNode* data;
      PNode* link;
   };

   // toolkit functions for LLoLL based on above node definitions
   void Destroy_cList(CNode*& cListHead);
   void Destroy_pList(PNode*& pListHead);
   void ShowAll_DF(PNode* pListHead, std::ostream& outs);
   void ShowAll_BF(PNode* pListHead, std::ostream& outs);
}

#endif

#include "nodes_LLoLL.h"
#include "cnPtrQueue.h"
#include <iostream>
using namespace std;

namespace CS3358_SP2023_A5P2
{
    
   // do breadth-first (level) traversal and print data
   void ShowAll_BF(PNode* pListHead, ostream& outs)
   {
       cnPtrQueue queue;
      CNode* currentNode;

      queue.push(lloLLPtr->getHead());

      while (!queue.empty())
      {
         currentNode = queue.front();
         queue.pop();

         if (currentNode->dataIsPtr)
         {
            queue.push(currentNode->getDownPtr());
         }
         else
         {
            std::cout << currentNode->getDownData() << "  ";
         }
      }

      std::cout << std::endl;
   }
   
   
   void Destroy_cList(CNode*& cListHead)
   {
      int count = 0;
      CNode* cNodePtr = cListHead;
      while (cListHead != 0)
      {
         cListHead = cListHead->link;
         delete cNodePtr;
         cNodePtr = cListHead;
         ++count;
      }
      cout << "Dynamic memory for " << count << " CNodes freed"
           << endl;
   }

   void Destroy_pList(PNode*& pListHead)
   {
      int count = 0;
      PNode* pNodePtr = pListHead;
      while (pListHead != 0)
      {
         pListHead = pListHead->link;
         Destroy_cList(pNodePtr->data);
         delete pNodePtr;
         pNodePtr = pListHead;
         ++count;
      }
      cout << "Dynamic memory for " << count << " PNodes freed"
           << endl;
   }

   // do depth-first traversal and print data
   void ShowAll_DF(PNode* pListHead, ostream& outs)
   {
      while (pListHead != 0)
      {
         CNode* cListHead = pListHead->data;
         while (cListHead != 0)
         {
            outs << cListHead->data << "  ";
            cListHead = cListHead->link;
         }
         pListHead = pListHead->link;
      }
   }
}

>sh -c make -s
./nodes_LLOLL.cpp:15:18: error: use of undeclared identifier 'lloLLPtr'
queue.push(lloLLPtr->getHead());
./nodes_LLOLL.cpp:22:27: error: no member named 'dataIsPtr' in 'CS3358_SP2023_A5P2::CNode'
if (currentNode->dataIsptr)
NNNNNNNNNNN
./nodes_LLOLL.cpp:24:37: error: no member named 'getDownPtr' in 'CS3358_SP2023_A5P2::CNode'
queue.push(currentNode->get DownPtr());
NNNN
NNNN
./nodes_LLOLL.cpp:28:39: error: no member named 'getDownData' in 'CS3358_SP2023_A5P2::CNode'
std::cout <<< currentNode->getDownData() << " ";
NN
4 errors generated.
make: *** [Makefile:10: main] Error 1
exit status 2
Q Û
Transcribed Image Text:>sh -c make -s ./nodes_LLOLL.cpp:15:18: error: use of undeclared identifier 'lloLLPtr' queue.push(lloLLPtr->getHead()); ./nodes_LLOLL.cpp:22:27: error: no member named 'dataIsPtr' in 'CS3358_SP2023_A5P2::CNode' if (currentNode->dataIsptr) NNNNNNNNNNN ./nodes_LLOLL.cpp:24:37: error: no member named 'getDownPtr' in 'CS3358_SP2023_A5P2::CNode' queue.push(currentNode->get DownPtr()); NNNN NNNN ./nodes_LLOLL.cpp:28:39: error: no member named 'getDownData' in 'CS3358_SP2023_A5P2::CNode' std::cout <<< currentNode->getDownData() << " "; NN 4 errors generated. make: *** [Makefile:10: main] Error 1 exit status 2 Q Û
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
ListBox
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education