在 python 中按级别顺序遍历二叉树

Question

如果我按级别顺序遍历它，我有一个python script that generate a binary tree for a given mathematical expression. I'm trying to write a function to print the binary tree。

例如如果函数是 ((2+3) - 4) 输出应该是

   -
  / \
 +   4
/ \
2  3

output: 
-
+ 4
2 3

将数学表达式转换为二叉树的代码

from pythonds.basic.stack import Stack
from pythonds.trees.binaryTree import BinaryTree

def buildParseTree(fpexp):
        fplist = fpexp.split()
        pStack = Stack()
        eTree = BinaryTree('')
        pStack.push(eTree)
        currentTree = eTree
        for i in fplist:
            if i == '(':
                currentTree.insertLeft('')
                pStack.push(currentTree)
                currentTree = currentTree.getLeftChild()
            elif i not in ['+', '-', '*', '/', ')']:
                currentTree.setRootVal(int(i))
                parent = pStack.pop()
                currentTree = parent
            elif i in ['+', '-', '*', '/']:
                currentTree.setRootVal(i)
                currentTree.insertRight('')
                pStack.push(currentTree)
                currentTree = currentTree.getRightChild()
            elif i == ')':
                currentTree = pStack.pop()
            else:
                raise ValueError
        return eTree

我正在使用广度优先搜索的标准伪代码。

printTree(Node root)

   if(root == NULL) return

   else
      create a queue 'q'
      q.enqueue(root)

      while(q is not empty)
           root = q.dequeue
           print(root)

           if(leftChild != NULL)
              q.enqueue(leftChild)
           if(rightChild != NULL)
              q.enqueue(rightChild)

以下是我编写的 python 代码，用于按级别顺序打印树。

import sys

class Node:
    def __init__(self, data):
        self.data = data
        self.leftChild = None
        self.rightChid = None


class Queue:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def enqueue(self,item):
        self.items.insert(0, item)

    def dequeue(self):
        self.items.pop()

def printNodesInLevels(root):
    if root is None:
        return
    else:
        q = Queue()
        q.enqueue(root)

        while(q is not None):
            root = q.dequeue()
            print(root.getRootVal())

            if(root.leftChild is not None):
                q.enqueue(root.leftChild)

            if(root.rightChild is not None):
                q.enqueue(root.rightChild)

这就是我调用函数的方式。

pt = buildParseTree("( ( 2 + 3 ) - 4 )")
printNodesInLevels(pt)

以下是我收到的错误消息。我想我没有正确地将树的根传递给打印函数。

None

Traceback (most recent call last): File "C:/Users/YASODA/PycharmProjects/HelloWorld/BinaryTree.py", line 77, in printNodesInLevels(pt) File "C:/Users/YASODA/PycharmProjects/HelloWorld/BinaryTree.py", line 67, in printNodesInLevels if(root.leftChild is not None): AttributeError: 'NoneType' object has no attribute 'leftChild'

Answer 1

您的代码中有两个错误。第一个是，你需要return in dequeue，

class Queue:
    def __init__(self):
        self.items = []

    def isEmpty(self):
        return self.items == []

    def enqueue(self,item):
        self.items.insert(0, item)

    def dequeue(self):
        return self.items.pop()

第二个在while循环中检查队列是否为空，

while(not q.isEmpty()):

在 python 中按级别顺序遍历二叉树

Traversing a binary tree in level order in python

python

binary-tree

breadth-first-search

tree-traversal