Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Find the in order traversal, pre order traversal, and post order traversal  USING this B T S code.

Find the in order traversal, pre order traversal, and post order traversal  USING this B T S code.

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
100%

Find the in order traversal, pre order traversal, and post order traversal  USING this B T S code.

--------------

class BinarySearchTreeNode:
def __init__(self, data):
self.data = data
self.left = None
self.right = None

def add_child(self, data):
if data == self.data:
return # node already exist

if data < self.data:
if self.left:
self.left.add_child(data)
else:
self.left = BinarySearchTreeNode(data)
else:
if self.right:
self.right.add_child(data)
else:
self.right = BinarySearchTreeNode(data)


# function to build the BST
def build_tree(elements):
print("INPUT NUMBERS:", elements)
root = BinarySearchTreeNode(elements[0])
for i in range(1, len(elements)):
root.add_child(elements[i])
return root

# function to find maximum value from the tree
def getMaxFromBST(root):
# storing value in temporary variable
temp = root
# looping over the right subtree
while(temp.right):
temp = temp.right
# returning the rightmost leaf data
return temp.data

# function to find minimum value from the tree
def getMinFromBST(root):
# storing value in temporary variable
temp = root
# looping over the left subtree
while(temp.left):
temp = temp.left
# returning the leftmost leaf data
return temp.data
 
# Function to find sum of all the element
def addBTS(root):
if (root == None):
return 0
return (root.data + addBTS(root.left) +
addBTS(root.right))




if __name__ == '__main__':
numbers_tree = build_tree([15, 12, 7, 14, 27, 20, 23, 88])
# calling the function to get the max and min value
min = getMinFromBST(numbers_tree)
max = getMaxFromBST(numbers_tree)
# printing the result
print("MAX: ", max)
print("MIN: ", min)
print("SUM: ",addBTS(numbers_tree))
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 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