Solve this problem using python language.(For the below tasks, you may want to create a binary tree manually and use the same tree for all of these tasks. However, for task 6, you need two trees; hence, prepare another)NB: All the methods(1-7) as well as the main method/tester statements must be written in one class. DO NOT write a different class for each method. Compile all your codes and show simulation picture RECURSIVELY calculate the height of a tree.RECURSIVELY calculate the level of a Node in a tree.Print elements of all the Nodes of a tree using Pre-order Traversal.Print elements of all the Nodes of a tree using In-order Traversal.Print elements of all the Nodes of a tree using Post-order Traversal.Write a method which will evaluate whether two trees are exactly same or not.Write a method which will return a copy (new tree) of a given tree.

by bartleby guidelines i am able to do only 3 parts but i have 5 parts .

Answered: Solve this problem using python…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

100%

Solve this problem using python language.

(For the below tasks, you may want to create a binary tree manually and use the same tree for all of these tasks. However, for task 6, you need two trees; hence, prepare another)

NB: All the methods(1-7) as well as the main method/tester statements must be written in one class. DO NOT write a different class for each method.

Compile all your codes and show simulation picture

RECURSIVELY calculate the height of a tree.
RECURSIVELY calculate the level of a Node in a tree.
Print elements of all the Nodes of a tree using Pre-order Traversal.
Print elements of all the Nodes of a tree using In-order Traversal.
Print elements of all the Nodes of a tree using Post-order Traversal.
Write a method which will evaluate whether two trees are exactly same or not.
Write a method which will return a copy (new tree) of a given tree.