Question

Python question. How do i make this code work? im trying to print the value of the nodes using the level order trasversal

class Node:
def __init__(self, x):
self.val = x
self.left = None
self.right = None

class BinarySearchTree:
def insertNode(self, value):
self.root = self._insert(self.root, value)
  
def levelOrderTraversal(self, root):
if root is None:
return []
result, current = [], [root]
while current:
next_level, vals = [], []
for node in current:
vals.append(node.val)
if node.left:
next_level.append(node.left)
if node.right:
next_level.append(node.right)
current = next_level
result.append(vals)
return result

t=BinarySearchTree()

for i in range(12):
x = (4*i+6)%21

t.levelOrder(x)

Answer 1

Python code:

class Node:

def __init__(self, x):

self.val = x

self.left = None

self.right = None

def levelOrderTraversal(root,height):

if root is None:

return

if height == 0:

print(root.val);

elif height > 0 :

levelOrderTraversal(root.left , height-1);

levelOrderTraversal(root.right , height-1);

def lengthH(node):

##Checking condition of root node being null.Then length will be zero

if node is None:

return 0;

## Either left subtree or right subtree exists

else:

##Calculate left subtree length

leftLength = lengthH(node.left)

##Calculate Right subtree length

rightLength = lengthH(node.right)

##We should consider the highest length

##Using if else block for that operation.

if leftLength>rightLength:

return leftLength+1;

else:

return rightLength+1;

root = Node(56)

root.right = Node(30)

root.left = Node(20)

##Saving right and left substree nodes

rootr = root.right

rootl = root.left

##Assigning new child Node using Saved node references

rootr.left = Node(100)

rootr.right = Node(50)

rootl.left = Node(150)

rootl.right = Node(200)

##Calculate length of tree using recursive method

lengthOfTree = lengthH(root)

for i in range(lengthOfTree):

levelOrderTraversal(root , i);

Output

56
20
30
150
200
100
50

Screenshot

II, anu must your programs and apps UTILITIE TUI ICC. main.py E saved 1 class Node: def __init__(self, x): self.val = x self.left = None self.right = None 150 200 100 50 def levelorderTraversal (root, height): if root is None: return if height == 0: print(root.val); elif height > O: levelorderTraversal (root. left , height-1); levelorderTraversal (root.right , height -1); def length (node): #*Checking condition of root node being null. Then length will be zero if node is None: return 0; ## Either left subtree or right subtree exists else: ##Calculate left subtree length leftLength = length (node.left) ##Calculate Right subtree length rightLength = length (node.right) #We should consider the highest length ##Using if else block for that operation.

20 150 200 100 50 def length (node): ##Checking condition of root node being null. Then length will be zero if node is None: return 0; ## Either left subtree or right subtree exists else: ##Calculate left subtree length leftLength = length (node.left) ##Calculate Right subtree length rightLength = length (node.right) ##We should consider the highest length ##Using if else block for that operation. if leftLength>rightLength: return leftLength+1; else: return rightLength+1; root = Node (56) root.right = Node (30) root.left = Node (20) 41 ##Saving right and left substree nodes rootr = root.right rootl = root.left 45 Accioning nu child Modo ucing Savod odoroforoncos

main.py E saved 56 38 150 root = Node (56) root.right = Node (30) root.left = Node (20) 200 100 50 ##Saving right and left substree nodes rootr = root.right rootl = root. left ##Assigning new child Node using Saved node references rootr.left = Node (100) rootr.right = Node (50) rootl.left = Node (150) rootl.right = Node (200) ##Calculate length of tree using recursive method lengthofTree = lengthH(root) for i in range(lengthof Tree): levelOrder Traversal (root , i);

Please refer attached screenshot for proper identation.