0107. Binary Tree Level Order Traversal II
https://leetcode.com/problems/binary-tree-level-order-traversal-ii
Description
Given the root
of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).
Example 1:
Example 2:
Example 3:
Constraints:
The number of nodes in the tree is in the range
[0, 2000]
.-1000 <= Node.val <= 1000
ac
Previous0106. Construct Binary Tree from Inorder and Postorder TraversalNext0108. Convert Sorted Array to Binary Search Tree
Last updated