107.Binary Tree Level Order Traversal II

发布时间：2020-12-14 04:15:46 所属栏目：大数据来源：网络整理

导读：Given a binary tree, return the?bottom-up level order?traversal of its nodes‘ values. (ie,from left to right,level by level from leaf to root).For example:?Given binary tree?[3,9,20, null ,15,7 ],? 3 / 9 20 / 15 7 return its bottom- up le

Given a binary tree,return the?bottom-up level order?traversal of its nodes‘ values. (ie,from left to right,level by level from leaf to root).
For example:?Given binary tree?[3,9,20,null,15,7],?
    3
   /   9  20
    /     15   7

return its bottom-up level order traversal as:?
[
  [15,[9,20],[3]
]



https://leetcode.com/problems/binary-tree-level-order-traversal-ii/discuss/34981/My-DFS-and-BFS-java-solution

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!