• Every node in a binary tree can have pointers to
  • Binary search trees are commonly used
  • The ________ operation allows an item to be removed from a stack.
  • A binary tree can be created using a structure containing a data value and
  • A function template's prefix contains ________ in angled brackets.
  • A practical application of the stack data type is
  • Binary search trees may be implemented as templates, but any data types used with them must support the ________ operator.
  • One method of traversing a binary tree is
  • The statement stack< int, vector > iStack; creates
  • In a function template, the programmer substitutes ________ for ________.
  • Deleting a node from a binary search tree node
  • A stack has two primary operations called
  • Polymorphism is when ________ in a class hierarchy perform differently, depending upon the class of the object making the call.
  • When using a node pointer to traverse a linked list, we know we have reached the end of a list when
  • A pure virtual function
  • One advantage a linked list has over a vector is that
  • The algorithms provided by the STL are implemented as ________, and perform various operations on elements of containers.
  • In the statement template , what does the word "class" indicate?
  • If information is transmitted faster than it can be processed, it can be held in a ________ while it awaits processing.
  • If a node has no successor, the corresponding pointer is set to
  • The shape of a binary search tree is
  • To build a linked list, we can
  • The three sequential container objects currently provided by the STL are:
  • When an error occurs, an exception is ________.
  • A linked list class using dynamically allocated memory should free its memory when the list is destroyed. This can be done by
  • If a base class is declared virtual, the compiler will make sure that
  • The list container provided by the Standard Template Library is a template version of a ________.
  • The arguments to a virtual base class must be passed by
  • For most people, ________ queues are more intuitive and easier to understand than ________ queues.
  • A dynamic queue can be implemented as a(n)________.
  • The main difference between a binary tree and a linked list is that
  • Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to
  • To concatenate two linked lists, it is necessary to
  • A(n) ________ is an abstract data type that stores and retrieves items in a last-in-first-out manner.
  • In a doubly-linked list, each node contains a pointer to the next node in the list, as well as a pointer to
  • Values are commonly stored in a binary search tree so that a node's ________ child holds data that is less than the ________ data.
  • Which of the following are linked list operations?
  • When a virtual member function of a class in a class hierarchy is invoked through a pointer to an object in the class hierarchy, the compiler will select the member function to be invoked
  • If the head pointer points to NULL, it is an indication that
  • A program keeps track of a binary tree using a pointer to
Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.