Problem Solving in Data Structures & Algorithms Using Python: Programming Interview Guide by Hemant Jain

Author:Hemant Jain [Jain, Hemant]
Language: eng
Format: azw3
Publisher: UNKNOWN
Published: 2017-01-17T16:00:00+00:00

Example 10.1:

def levelOrderBinaryTree(self, arr):

self.root = self.levelOrderBinaryTreeUtil(arr, 0)

def levelOrderBinaryTreeUtil(self, arr, start):

size = len(arr)

curr = self.Node(arr[start])

left = 2 * start + 1

right = 2 * start + 2

if left < size:

curr.lChild = self.levelOrderBinaryTreeUtil(arr, left)

if right < size:

curr.rChild = self.levelOrderBinaryTreeUtil(arr, right)

return curr

@classmethod

def main(cls, args):

arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

t2 = Tree()

t2.levelOrderBinaryTree(arr)

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.