#Given a binary tree, find the deepest node # that is the left child of its parent node. # Example: # 1 # / # 2 # / \ # 4 5 1 3 1 6 # \ # 7 # should return 4. from tree.tree import TreeNode class Deepest Left: def __init__(self): self.depth = 0 self. Node = None
#Given a binary tree, find the deepest node # that is the left child of its parent node. # Example: # 1 # / # 2 # / \ # 4 5 1 3 1 6 # \ # 7 # should return 4. from tree.tree import TreeNode class Deepest Left: def __init__(self): self.depth = 0 self. Node = None
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...
Related questions
Question
Help thwre dor question.
Transcribed Image Text:46 lines (36 sloC) 985 Bytes
1
2
3
4
5
6
7
8
9
#Given a binary tree, find the deepest node
# that is the left child of its parent node.
# Example:
# 1
# /
# 2
# / \
# 4 5
3
10
11
12
# 7
13 # should return 4.
14
15
16
17
18
19
20
21
22
23
24 def find_deepest_left(root, is_left, depth, res):
25
if not root:
26
27
28
29
30
31
32
33
34 if __name__ == '_____main__':
35
root = TreeNode (1)
36
root.left = TreeNode (2)
37
root.right = TreeNode (3)
38
39
40
41
42
43
44
45
46
6
from tree.tree import TreeNode
class Deepest Left:
def __init__(self):
self.depth = 0
self. Node = None
return
if is left and depth>res.depth:
res.depth =
res. Node = root
find_deepest_left(root.left, True, depth + 1, res)
find_deepest_left(root.right, False, depth + 1, res)
depth
root.left.left = TreeNode (4)
root.left.right = TreeNode (5)
root.right.right = TreeNode (6)
root.right.right.right = TreeNode (7)
res= Deepest Left()
find_deepest_left(root, True, 1, res)
if res.Node:
print (res.Node.val)
Raw Blame
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY