二叉树的前中后序遍历（统一迭代和递归）

最新推荐文章于 2024-08-28 10:31:29 发布

RealKeyboardMan

最新推荐文章于 2024-08-28 10:31:29 发布

阅读量268

点赞数

分类专栏：算法与数据结构文章标签：数据结构算法 leetcode

本文链接：https://blog.csdn.net/weixin_40108561/article/details/122178917

版权

算法与数据结构专栏收录该内容

47 篇文章 0 订阅

订阅专栏

迭代

前序遍历

func preorderTraversal(root *TreeNode) []int {
	var ret []int
	if root == nil {
		return ret
	}
	dequeue := []*TreeNode{root}
	for len(dequeue) != 0 {
		n := len(dequeue)
		node := dequeue[n-1]
		if node != nil {
			dequeue = dequeue[:n-1]
			if node.Right != nil {
				dequeue = append(dequeue, node.Right) // 右
			}
			if node.Left != nil {
				dequeue = append(dequeue, node.Left)  // 左
			}
			dequeue = append(dequeue, node)			  // 中
			dequeue = append(dequeue, nil)
		} else {
			node = dequeue[n-2]
			dequeue = dequeue[:n-2]
			ret = append(ret, node.Val)
		}
	}
	return ret
}

中序遍历

func preorderTraversal(root *TreeNode) []int {
	var ret []int
	if root == nil {
		return ret
	}
	dequeue := []*TreeNode{root}
	for len(dequeue) != 0 {
		n := len(dequeue)
		node := dequeue[n-1]
		if node != nil {
			dequeue = dequeue[:n-1]
			if node.Right != nil {
				dequeue = append(dequeue, node.Right) // 右
			}
			dequeue = append(dequeue, node)			  // 中
			dequeue = append(dequeue, nil)
			if node.Left != nil {
				dequeue = append(dequeue, node.Left)  // 左
			}
		} else {
			node = dequeue[n-2]
			dequeue = dequeue[:n-2]
			ret = append(ret, node.Val)
		}
	}
	return ret
}

后序遍历

func preorderTraversal(root *TreeNode) []int {
	var ret []int
	if root == nil {
		return ret
	}
	dequeue := []*TreeNode{root}
	for len(dequeue) != 0 {
		n := len(dequeue)
		node := dequeue[n-1]
		if node != nil {
			dequeue = dequeue[:n-1]
			dequeue = append(dequeue, node)			  // 中
			dequeue = append(dequeue, nil)
			if node.Right != nil {
				dequeue = append(dequeue, node.Right) // 右
			}
			if node.Left != nil {
				dequeue = append(dequeue, node.Left)  // 左
			}
		} else {
			node = dequeue[n-2]
			dequeue = dequeue[:n-2]
			ret = append(ret, node.Val)
		}
	}
	return ret
}

递归

前序遍历

func preorderTraversal(root *TreeNode) []int {
    var ret []int
    return preOrder(root,ret)
}

func preOrder(root *TreeNode, ret []int) []int{
    if root == nil {
        return ret
    }
    ret = append(ret,root.Val)
    ret = preOrder(root.Left,ret)
    ret = preOrder(root.Right,ret)
    return ret
}