12.7 The BinaryTree class is a recursive data structure, unlike the List class. Describe how the List class would be different if it were implemented as a recursive data structure. 12.8 The parent reference in a BinaryTree is declared protected and is accessed through the accessor methods parent and setParent. Why is this any different than declaring parent to be public.

12.7 The BinaryTree class is a recursive data structure, unlike the List class. Describe how the List class would be different if it were implemented as a recursive data structure. 12.8 The parent reference in a BinaryTree is declared protected and is accessed through the accessor methods parent and setParent. Why is this any different than declaring parent to be public.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

17-14 C++ Instructions Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose: queue = {5, 11, 34, 67, 43, 55} and n = 3. After a call to the function moveNthFront: queue = {34, 5, 11, 67, 43, 55} Add this function to the class queueType. Also, write a program (in main.cpp) to test your method.
4.3 Refer to the code fragment below and convert the following Queue structure into a Stack structure. You should create a reference called S1 for the stack structure. Code: Queue Q1 = new LinkedList (); Q1.add("Sandra"); Q1.add (15); Q1.add (200); Q1.add ('#'); Q1. remove (); System.out.println(Q1); System.out.println(Q1.peek()); Q1.add("Mary"); System.out.println(Q1);
Short answer: Answer the following in your own words: 1) Your friend says they implemented a stack as a linked list with reference pointers to both a head and the tail node (i.e. they implemented a stack as a double endedlinked list). They said this significantly improved the performance for all functions (push, pop, search, and update). Are they correct? Why or why not?
Q.2. Implement a single linked list. Elements of this linked list should be of integer type, user would provide values as input for elements of this linked list. Which does not allow insertion of duplicate value to the list.
Implement a class representing a circular sorted linked list. The class must have the following requirements: The linked list and the nodes must be implemented as C++ templates First must point to the largest value in the list It must include a constructor, a destructor, a copy constructor and an operator= It must include functions to insert a given item, delete a given item, search for a given item, check if the list is empty, return the length of the list and print the list (from smallest to largest) Hint: Use the menu-driven program of the linked list to test all the functions in your class. Screenshot the output and make comments on each area on the program.
Consider the following linked list: Give the correct sequence to steps to the list be like below: I Move current pointer to the position to delete i.e. node D, II Move the previous pointer behind the current pointer i.e. node C III Make the node C to point to next of node D. IV Delete the node D Select one: A.II, I, IV, III B.I, II, III, IV C.IV, I, II, III D.IV, III, II, I
Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }
TRUE or FALSE? Answer the following question and state the reason why: A circular linked list has 2 node pointers. cout<<list.back()<<endl; = The back member function returns a reference to the last element in the list. In a Dynamic Stack, the pointer top stays at the head after a push operation. During a Pop operation in Static Stack, the elements are being moved one step up. In a dynamic implementation of stack, the pointer top has an initial value of null.
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
TRUE or FALSE? Answer the following question and state the reason why: cout<<list.back()<<endl; = The back member function returns a reference to the last element in the list. In a Dynamic Stack, the pointer top stays at the head after a push operation. During a Pop operation in Static Stack, the elements are being moved one step up. In a dynamic implementation of stack, the pointer top has an initial value of null.
PP 12.7 Implement an postfix-to-infix translator using stacks. The applicationshould repeatedly read a postfix expression and print the equivalentinfix expression until the user quits. Throw an exception if the postfixexpression entered is invalid.PP 12.8 Implement a class called ReverseWords that uses a stack to output a set of elements input by the user in reverse order.
@6 The Reference-based Linked Lists: Select all of the following statements that are true. options: As a singly linked list's node references both its predecessor and its successor, it is easily possible to traverse such a list in both directions. According to the terminology introduced in class, the head reference variable in a singly linked list object references the list's first node. According to the terminology introduced in class, in a doubly linked list, each node references both the head and tail node. In a double-ended singly linked list, the tail reference variable provides access to the entire list. In a circular linked list, the last node references the first node.