Python实现二叉树的遍历
2017-09-26 16:39
447 查看
Python实现二叉树的遍历
class BinaryTree(object): def __init__(self, value=None, left=None, right=None): self.value = value self.left = left self.right = right def rebuild(self, preOrder, inOrder): """ 根据前序列表和中序列表,重建二叉树 :param preOrder: 前序列表 :param inOrder: 中序列表 :return: 二叉树 """ if preOrder == None or inOrder == None or len(preOrder) <=0 or len(inOrder) <=0 \ or len(preOrder) != len(inOrder): return None cur = BinaryTree(preOrder[0]) index = inOrder.index(preOrder[0]) cur.left = self.rebuild(preOrder[1: index+1], inOrder[:index]) cur.right = self.rebuild(preOrder[index+1:], inOrder[index+1:]) return cur def preOrder(self, tree): """ 前序遍历 :param tree: :return: """ if tree == None: return None print(tree.value, end=' ') self.preOrder(tree.left) self.preOrder(tree.right) def preOrderLoop(self, tree): """ 前序遍历的循环实现 :param tree: :return: """ if tree == None: return None lst = [] node = tree while node != None or len(lst) > 0: if node != None: lst.append(node) print(node.value, end=' ') node = node.left else: item = lst[len(lst)-1] lst = lst[:-1] node = item.right def inOrder(self, tree): """ 中序遍历 :param tree: :return: """ if tree == None: return None self.inOrder(tree.left) print(tree.value, end=' ') self.inOrder(tree.right) def inOrderLoop(self, tree): """ 中序遍历循环实现 :param tree: :return: """ if tree == None: return lst = [] node = tree while node != None or len(lst) > 0: if node != None: lst.append(node) node = node.left else: item = lst[len(lst)-1] lst = lst[:-1] print(item.value, end=' ') node = item.right def postOrder(self, tree): """ 后序遍历 :param tree: :return: """ if tree == None: return None self.postOrder(tree.left) self.postOrder(tree.right) print(tree.value, end=' ') def postOrderLoop(self, tree): """ 后续遍历的循环实现 :param tree: :return: """ if tree == None: return None visited = set() lst = [] node = tree while node != None or len(lst) > 0: if node != None: lst.append(node) node = node.left else: item = lst[len(lst)-1] if item.right != None and item.right not in visited: node = item.right else: print(item.value, end=' ') visited.add(item) lst = lst[:-1]
相关文章推荐
- Python实现二叉树的存储和遍历
- python实现二叉树的建立以及遍历(递归前序、中序、后序遍历,队栈前序、中序、后序、层次遍历)
- 二叉树的建立以及遍历的多种实现(python版)
- python实现二叉树的遍历
- python 用栈和队列实现二叉树的深度优先遍历(三种)和广度优先遍历
- 二叉树的四种遍历方式 (前序,中序,后序,层序遍历 python实现)
- 《面试》---Python 实现二叉树结构以及相关遍历
- python实现的二叉树定义与遍历算法实例
- 利用对象的思想创建二叉树并实现四种遍历(广序,先序,中序,后序)-python3版
- python实现二叉树,前序遍历,中序遍历,后续遍历
- 【python中二叉树的实现】python中二叉树的创建、三种方式递归遍历和非递归遍历
- python实现二叉树及插入,遍历操作
- Python实现二叉树的前序遍历、中序遍历
- python实现二叉树以及二叉树的遍历--1(函数实现)
- python实现树及二叉树的遍历
- python实现二叉树及其七种遍历方式(递归+非递归)
- 二叉树递归遍历的python实现
- Python实现输入二叉树的先序和中序遍历,再输出后序遍历操作示例
- python实现二叉树和它的七种遍历
- python实现二叉树和它的七种遍历