a. Write a function which will take a binary tree as input and return the total number of nodes in: the tree. Your code must count the nodes by traversing the tree. b. Wite a function which will take a binary tree as input and return the number of total number ef leaves in the tree. Your code must count the leaves by traversing the tree. c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternary tree may have at most 3 children. You may need to modify the TreeNode class discussed ir. class and add funetions to insert nodes. d. We discussed a methodology to delete a node which has 2 children from BST and in ormally argued avcut the correctness of this methodology. An alternative methodology is shown below. The node X has two children, and we wish to delete X. The tree is rearranged as shown in the right after deleting X. Show that the alternative technique also preserves BST property. Write code to implement the alternative technique. [20]

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...
icon
Related questions
Question
C using python
Write a function which will take a binary tree as input and return the total number of nodes
in: the tree. Your code must count the nodes by traversing the tree.
a.
b. Wite a function which will take a binary tree as input and return the number of total
number ef leaves in the tree. Your code must count the leaves by traversing the tree.
c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternary
tree may have at most 3 ehildren. You may need to modify the TreeNode class discussed
ir. class and adl functions to insert nodes.
d. We discussed a methodology to delete a node which has 2 children from BST and
in ormally argued avout the correctness of this methodology,
An alternative methodology is shown below. The node X has two children, and we wish to
delete X. The tree is rearanged as shown in the right after deleting X. Show that the
alternative technique also preserves BST property. Write code to implement the alternative
technique. [20]
Transcribed Image Text:Write a function which will take a binary tree as input and return the total number of nodes in: the tree. Your code must count the nodes by traversing the tree. a. b. Wite a function which will take a binary tree as input and return the number of total number ef leaves in the tree. Your code must count the leaves by traversing the tree. c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternary tree may have at most 3 ehildren. You may need to modify the TreeNode class discussed ir. class and adl functions to insert nodes. d. We discussed a methodology to delete a node which has 2 children from BST and in ormally argued avout the correctness of this methodology, An alternative methodology is shown below. The node X has two children, and we wish to delete X. The tree is rearanged as shown in the right after deleting X. Show that the alternative technique also preserves BST property. Write code to implement the alternative technique. [20]
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY