Esempi in Python per Queue

Esempio n. 1

File: binarysearchtree.py Progetto: Anuragjain20/Data-structure-and-algo

def levelOrderTraversal(rootNode):
    if not rootNode:
        return
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            print(root.value.data)
            if (root.value.leftChild is not None):
                customqueue.enqueue(root.value.leftChild)
            if (root.value.rightChild is not None):
                customqueue.enqueue(root.value.rightChild)

Esempio n. 2

File: binaryTree.py Progetto: Anuragjain20/Data-structure-and-algo

def getDeepestNode(rootNode):
    if not rootNode:
        return
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            if (root.value.leftChild is not None):
                customqueue.enqueue(root.value.leftChild)
            if (root.value.rightChild is not None):
                customqueue.enqueue(root.value.rightChild)
        deepestNode = root.value
        return deepestNode

Esempio n. 3

File: binaryTree.py Progetto: Anuragjain20/Data-structure-and-algo

def searchBT(rootNode, nodevalue):
    if not rootNode:
        return " the bt does not exists"
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            if root.value.data == nodevalue:
                return "Success"
            if (root.value.leftChild is not None):
                customqueue.enqueue(root.value.leftChild)
            if (root.value.rightChild is not None):
                customqueue.enqueue(root.value.rightChild)
        return "Unsuccess"

Esempio n. 4

File: binaryTree.py Progetto: Anuragjain20/Data-structure-and-algo

def deleteNodeBT(rootNode, node):
    if not rootNode:
        return "root node does not exist"
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            if root.value.data == node:
                dNode = getDeepestNode(rootNode)
                root.value.data = dNode.data
                deleteDeepestNode(rootNode, dNode)
                return "deleted"
            if (root.value.leftChild is not None):
                customqueue.enqueue(root.value.leftChild)
            if (root.value.rightChild is not None):
                customqueue.enqueue(root.value.rightChild)
        return "failed"

Esempio n. 5

File: binaryTree.py Progetto: Anuragjain20/Data-structure-and-algo

def insertNode(rootNode, newNode):
    if not rootNode:
        rootNode = newNode
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            if (root.value.leftChild is not None):
                customqueue.enqueue(root.value.leftChild)
            else:
                root.value.leftChild = newNode
                return

            if (root.value.rightChild is not None):
                customqueue.enqueue(root.value.rightChild)
            else:
                root.value.rightChild = newNode
                return

Esempio n. 6

File: binaryTree.py Progetto: Anuragjain20/Data-structure-and-algo

def deleteDeepestNode(rootNode, dNode):
    if not rootNode:
        return
    else:
        customqueue = queue.Queue()
        customqueue.enqueue(rootNode)
        while not (customqueue.isEmpty()):
            root = customqueue.dequeue()
            if root.value is dNode:
                root.value = None
            if root.value.rightChild:
                if root.value.rightChild is dNode:
                    root.value.rightChild = None
                else:
                    customqueue.enqueue(root.value.rightChild)
            if root.value.leftChild:
                if root.value.leftChild is dNode:
                    root.value.leftChild = None
                else:
                    customqueue.enqueue(root.value.leftChild)