Question

Can you complete the following code, please? Thank you.

instructions trom your teach In-order Traversal In this assignment, you are asked to write a function to return the list containing the value of nodes traversed in-order To do this, add all the in-order values from the left sub- tree, then add the current element, then add all in-order values from the right subtree, When you reach an empty node, stop traversing down that side. Fora BST, this will return a sorted list. Consider the following example tree 15 25

class BinaryNode:
def __init__(self, value):
self.__value = value
self.__left = None
self.__right = None
self.__parent = None
self.__height = 1
  
def getValue(self):
return self.__value
  
def setHeight(self, height):
self.__height = height
  
def getHeight(self):
return self.__height
  
def setParent(self, node):
self.__parent = node
  
def getParent(self):
return self.__parent
  
def setLeftChild(self, child):
self.__left = child
child.setParent(self)
  
def setRightChild(self, child):
self.__right = child
child.setParent(self)
  
def createLeftChild(self, value):
self.__left = BinaryNode(value)
  
def createRightChild(self, value):
self.__right = BinaryNode(value)
  
def getLeftChild(self):
return self.__left
  
def getRightChild(self):
return self.__right
  
def __repr__(self):
return f'BinaryNode: {self.__value}'

def inorder(root):
# Your code here

Answer 1

class BinaryNode:

    def __init__(self, value):

        self.__value = value

        self.__left = None

        self.__right = None

        self.__parent = None

        self.__height = 1

    def getValue(self):

        return self.__value

    def setHeight(self, height):

        self.__height = height

    def getHeight(self):

        return self.__height

    def setParent(self, node):

        self.__parent = node

    def getParent(self):

        return self.__parent

    def setLeftChild(self, child):

       

        self.__left = child

        child.setParent(self)

    def setRightChild(self, child):

        self.__right = child

        child.setParent(self)

    def createLeftChild(self, value):

        self.__left = BinaryNode(value)

    def createRightChild(self, value):

        self.__right = BinaryNode(value)

    def getLeftChild(self):

        return self.__left

    def getRightChild(self):

        return self.__right

    def __repr__(self):

        return f'BinaryNode: {self.__value}'

def inorder(root):

    arr = []

   

    inorderUtil(root, arr)

   

    return arr

   

def inorderUtil(root, arr):

    # if the current subtree is not empty

    if root != None:

   

        # recursively traverse the left subtree

        inorderUtil(root.getLeftChild(), arr)

       

        # add the current node into the tree

        arr.append(root.getValue())

           

        # recursively traverse the right subtree

        inorderUtil(root.getRightChild(), arr)

       

# create node

root = BinaryNode(15)

# create node

n1 = BinaryNode(5)

# set n1 as the left child to root

root.setLeftChild(n1)

n2 = BinaryNode(22)

# set n2 as the right child to root

root.setRightChild(n2)

n3 = BinaryNode(1)

n4 = BinaryNode(10)

n5 = BinaryNode(18)

n6 = BinaryNode(25)

n1.setLeftChild(n3)

n1.setRightChild(n4)

n2.setLeftChild(n5)

n2.setRightChild(n6)

print(inorder(root))

Sample Output

C: \Users\Rishab\Desktop>python BST.py [1, 5, 10, 15, 18, 22, 25]