Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
# Function to print Leaf # a given level

# Function to print Leaf # a given level

Computer Networking: A Top-Down Approach (7th Edition)
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
icon
Related questions
Question


Note:

Solve question using python language.

ở tree height.py > ... # Function to print Leaf Nodes at # a given level def PrintLeafNodes(root, level): if (root == None): 18 19 20 21 22 return 23 if (level == 1): if (root.left == None and root.right == None): 24 25 26 27 print(root.data, end = " ") 28 elif (level > 1): PrintLeafNodes(root.left, level - 1) PrintLeafNodes(root.right, level - 1) 29 30 31 32 33 if name main_": 34 root=newNode(1) root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(6); 35 36 37 38 root.right.right = newNode(4); root.left.left.left = newNode(8); root.left.left.right = newNode(7); 39 40 41 42 level = 4; 43 PrintLeafNodes(root, level); PROBLEMS OUTPUT DEBUG CONSOLE TERMINAL PS C: \Users\amber\Desktop\Python Practice\LabPractice> & C:/Users/amber/AppData/Local/Pro Python Practice/LabPractice/tree height.py" 87 PS C:\Users\amber\Desktop\Python Practice\LabPractice> Create an appropriate loop to find the complete traversal of the given tree. Write code and outcome
Transcribed Image Text:ở tree height.py > ... # Function to print Leaf Nodes at # a given level def PrintLeafNodes(root, level): if (root == None): 18 19 20 21 22 return 23 if (level == 1): if (root.left == None and root.right == None): 24 25 26 27 print(root.data, end = " ") 28 elif (level > 1): PrintLeafNodes(root.left, level - 1) PrintLeafNodes(root.right, level - 1) 29 30 31 32 33 if name main_": 34 root=newNode(1) root.left = newNode(2); root.right = newNode(3); root.left.left = newNode(6); 35 36 37 38 root.right.right = newNode(4); root.left.left.left = newNode(8); root.left.left.right = newNode(7); 39 40 41 42 level = 4; 43 PrintLeafNodes(root, level); PROBLEMS OUTPUT DEBUG CONSOLE TERMINAL PS C: \Users\amber\Desktop\Python Practice\LabPractice> & C:/Users/amber/AppData/Local/Pro Python Practice/LabPractice/tree height.py" 87 PS C:\Users\amber\Desktop\Python Practice\LabPractice> Create an appropriate loop to find the complete traversal of the given tree. Write code and outcome
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS