LeetCode 剑指 Offer 32 - III. 从上到下打印二叉树 III

Categories:

Tags:

题目描述
思路分析
参考代码

题目描述

✅ 剑指 Offer 32 - III. 从上到下打印二叉树 III

思路分析

层序遍历

参考代码

func decorateRecord(root *TreeNode) [][]int {
	if root == nil {
		return nil
	}

	var res [][]int
	queue := []*TreeNode{root}
	leftToRight := true

	for len(queue) > 0 {
		size := len(queue)
		var level []int

		for i := 0; i < size; i++ {
			node := queue[0]
			queue = queue[1:]

			if leftToRight {
				level = append(level, node.Val)
			} else {
				level = append([]int{node.Val}, level...) // 从右到左
			}

			if node.Left != nil {
				queue = append(queue, node.Left)
			}
			if node.Right != nil {
				queue = append(queue, node.Right)
			}
		}

		res = append(res, level)
		leftToRight = !leftToRight
	}

	return res
}

➡️ 点击查看 Java 题解

write your code here

本文作者: HGNULB

本文链接: https://hgnulb.github.io/blog/2024/82368797