Question: 4. [30 marks] (Binary tree) Write 1) a non-recursive function to list out the nodes ofa binary tree in preorder, 2) a function to list

4. [30 marks] (Binary tree) Write 1) a non-recursive function to

list out the nodes ofa binary tree in preorder, 2) a function

to list out the nodes of a binary tree in level- order

4. [30 marks] (Binary tree) Write 1) a non-recursive function to list out the nodes ofa binary tree in preorder, 2) a function to list out the nodes of a binary tree in level- order or breadth first order, that is, to visit the nodes level by level, in each level visit the nodes from left to right. These functions take a pointer to the root node of a tree, and the function prototypes are shown below. / funcs.cpp # include #include "Stack,h" #include "Queue"h" using namespace std; template struct BinaryNode T element; BinaryNode left; BinaryNode* right; BinaryNode (constT&d T):element (d) left-nullptr; right nulipt r ; //print the elements of binary tree in preorder template void preorder (const BinaryNode void breadthfirst (const BinaryNode root) // add your code 3) Write an application program a3q4.cpp that contains a create_binary_tree () function which create the following binary tree (refer to lab 6 exercise click the link). contains main function which call create_binary_tree ) function to create a binary tree, and then call preorder and breadthfirst functions to print the nodes in preorder and level order, respectively. 1) the stack and queue class templates Stack.h and Queue.h, 2) the file funcs.cpp which contains the implementation of functions, 3) the application file a 3q4.cpp containing main) function a script file a3q4result containing result. 4) Here are the sample runs: The preorder: A B D GICEHJK F The level order: A B CDEF GHI J K Hint: The non-recursive preorder traversal uses a stack to store the nodes of the tree. First push the root of the tree in the stack. Then use a while loop: if the stack of nodes is not empty, visit the element of the node at the top position, pop the node, and push the right child and left child of the node. Repeat until the stack is empty. The level-order traversal uses a queue to store the nodes of the tree. First enqueue the root of the tree in the queue. Then use a while loop: if the queue of nodes is not empty, visit the element of the node at the queue front, enqueue the left child and right child of the node. And then dequeue the node. Repeat until the queue is empty

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

This is in C++ and I need it as soon as possible 4. [30 marks] (Binary tree) Write 1) a non-recursive function to list out the nodes of a binary tree in preorder, 2) a function to list out the nodes...

19.1) Add these three functions to the class binaryTreeType (provided). Write the definition of the function, nodeCount, that returns the number of nodes in the binary tree. Write the definition of...

Using the functions at the bottom please help out . Using the same method headers shown below. Using these functions 1. Write the function is_root_leaf_bst (T) that receives a reference to a binary...

I need solve this questions please 1. Perform the selection sort on the given array. Show the content of the array after each pass, until sorted. 2. Perform the bubble sort on the given array. Show...

c ) Why can't we just use arrays? Briefly explain why we need ADTs such as Stacks, Queues, Lists. [ 2 ] d ) Write a java implementation of the following operations on a Queue: i . Enqueue [ 4 ] ii ....

1. Write a C function void transpose(int *m, int n) that transposes n by n matrix m. 2. Write a C function int evaluate_polynomial(int al, int n, int x) to evaluate polynomial 3. Write a C function...

Write the following functions and add them to the BST class that was explained in the class: a) A function to count the number of nodes in a binary tree (15 points) b) A function to count the number...

// funcs.cpp #include using namespace std; template struct BinaryNode { T element; BinaryNode* left; BinaryNode* right; BinaryNode(const T & d = T()): element(d) { left = nullptr; right = nullptr; }...

ThreeDigitTree Count the number of different three - digit numbers that can be created by traversing a tree. Task description The problem focuses on binary trees, represented by pointer data...

Solve in Standard Meta Language of New Jersey (SML) and use only recursive definitions built up from the basic built-in functions! In SML, a polymorphic binary tree type with data both at the leaves...

A used food truck for selling food at events costs $35,000. at the present time. You think you can earn a net return of $6,700 at the ends of years 1 through 6. The equipment will be worth $4,000...

What is franchising?

When redeeming shares of an open and investment company, mutual fund and investor will receive

5. Develop a scenario comparing two PH programs and involving the use of a CBA.

5 There is also a need to think from different perspectives and at the different multifunctional, corporate and subsidiary levels. This requires managers to be open-minded, flexible and adaptable.

Whilst delayering and downsizing may be aspects of organizing which are contingent on responding to the needs of economic downturn, shareholders interests and efficiency, they may be less effective...

3 What specific practices, such as autonomous and cross-functional teams, and principles, such as empowerment, are best suited to which cultural contexts? How are these practices (with their...