二叉树前序、中序、后序遍历-python

最新推荐文章于 2022-05-22 20:39:41 发布

程序员进化者

最新推荐文章于 2022-05-22 20:39:41 发布

阅读量180

点赞数

分类专栏： Python 面试相关文章标签： python 数据结构

本文链接：https://blog.csdn.net/wh672843916/article/details/105503775

版权

面试相关同时被 2 个专栏收录

11 篇文章 1 订阅

订阅专栏

Python

5 篇文章 0 订阅

订阅专栏

一、中序遍历

def inorderTraversal(root):
    if not root:
        return []
    return inorderTraversal(root.left) + [root.val] + inorderTraversal(root.right)

def inorderTraversal(root):
    stack = []
    sol = []
    curr = root
    while stack or curr:
        if curr:
            stack.append(curr)
            curr = curr.left
        else:
            curr = stack.pop()
            sol.append(curr.val)
            curr = curr.right
    return sol

二、前序遍历

def preorderTraversal(root):
    if not root:
        return []
    return [root.val] + inorderTraversal(root.left) + inorderTraversal(root.right)

def preorderTraversal(root):
    stack = []
    sol = []
    curr = root
    while stack or curr:
        if curr:
            sol.append(curr.val)
            stack.append(curr.right)
            curr = curr.left
        else:
            curr = stack.pop()
    return sol

三、后序遍历

def postorderTraversal(root):
    if not root:
        return []
    return inorderTraversal(root.left) + inorderTraversal(root.right) + [root.val]

def postorderTraversal(root):
    stack = []
    sol = []
    curr = root
    while stack or curr:
        if curr:
            sol.append(curr.val)
            stack.append(curr.left)
            curr = curr.right
        else:
            curr = stack.pop()
    return sol[::-1]