给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
例如:
给定二叉树 [3,9,20,null,null,15,7],
返回其自底向上的层次遍历为:
[
[15,7],
[9,20],
[3]
]
解法:
使用递归遍历二叉树框架的基本方法,同时添加 list 、 depth 两个参数实现,depth记录层级,list为结果数组
PHP
/**
* Definition for a binary tree node.
* class TreeNode {
* public $val = null;
* public $left = null;
* public $right = null;
* function __construct($value) { $this->val = $value; }
* }
*/
class Solution {
/**
* @param TreeNode $root
* @return Integer[][]
*/
function levelOrderBottom($root)
{
$list = [];
$this->recu($root, 0, $list);
return array_reverse($list);
}
function dfs($root, $depth, &$list)
{
if ($root == null) {
return;
}
if (empty($list[$depth])) {
$list[$depth] = [];
}
array_push($list[$depth], $root->val);
$this->recu($root->left, $depth + 1, $list);
$this->recu($root->right, $depth + 1, $list);
}
}
GO
/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func levelOrderBottom(root *TreeNode) [][]int {
var list [][]int
dfs(root, 0, &list)
for i, j := 0, len(list) - 1; i < j; i, j = i + 1, j - 1 {
list[i], list[j] = list[j], list[i]
}
return list
}
func dfs(root *TreeNode, depth int, list *[][]int) {
if root == nil {
return
}
if depth == len(*list) {
*list = append(*list, []int{root.Val})
} else {
(*list)[depth] = append((*list)[depth], root.Val)
}
dfs(root.Left, depth + 1, list)
dfs(root.Right, depth + 1, list)
}