366. Find Leaves of Binary Tree

阿新 • • 發佈：2021-07-03

Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:
Given binary tree

Returns[4, 5, 3], [2], [1]. Explanation: 1. Removing the leaves[4, 5, 3]would result in this tree:

          1
         / 
        2

2. Now removing the leaf[2]would result in this tree:

3. Now removing the leaf[1]would result in the empty tree:

[]

Returns[4, 5, 3], [2], [1]. https://zhuhan0.blogspot.com/2017/05/leetcode-366-find-leaves-of-binary-tree.html

https://www.youtube.com/watch?v=2vwTmHTL1Mk&ab_channel=XavierElon

這題還比較新（對我），解決辦法是計算每個node的height，子節點是0，網上走，root = Math。max（left，right）+ 1。root==null就返回-1.

然後看是否需要加入新的ArrayList，然後把相同height的node加到對應的list中

366. Find Leaves of Binary Tree

Given a binary tree, collect a tree\'s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty.

[LeetCode] 662. Maximum Width of Binary Tree

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as afull binary tree

662. Maximum Width of Binary Tree

0662. Maximum Width of Binary Tree (M)

Maximum Width of Binary Tree (M) 題目 Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has t

104. Maximum Depth of Binary Tree; 111. Minimum Depth of Binary Tree; 112. Path Sum

二叉樹 Binary Tree 問題：給定層序遍歷的陣列表示二叉樹。 ⚠️ 注意：leaf節點：既無左孩子，又無右孩子

0111. Minimum Depth of Binary Tree (E)

Minimum Depth of Binary Tree (E) 題目 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

leetcode 111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

0104. Maximum Depth of Binary Tree (E)

Maximum Depth of Binary Tree (E) 題目 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

【LeetCode】104 Maximum Depth of Binary Tree

技術標籤：leetcode演算法dfs 原題地址:https://leetcode.com/problems/maximum-depth-of-binary-tree/

LeetCode - Easy - 111. Minimum Depth of Binary Tree

技術標籤：LeetCode演算法與資料結構leetcodetreebfsdfs Topic TreeBreadth-first SearchDepth-first Search

【資料結構】演算法 Maximum Width of Binary Tree 二叉樹最大寬度

目錄Maximum Width of Binary Tree 二叉樹最大寬度思路Tag Maximum Width of Binary Tree 二叉樹最大寬度

104.maximum-depth-of-binary-tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

LeetCode 0104 Maximum Depth of Binary Tree

原題傳送門 1. 題目描述 2. Solution 1 1、思路分析遞迴實現 1> 遞迴出口。遍歷當前結點為空，返回0。

LeetCode 111 Minimum Depth of Binary Tree BFS

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

637. Average of Levels in Binary Tree

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

【刷題-LeetCode】236. Lowest Common Ancestor of a Binary Tree

Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

987. Vertical Order Traversal of a Binary Tree

Given a binary tree, return thevertical ordertraversal of its nodesvalues. For each node at position(X, Y), its left and right children respectivelywill be at positions(X-1, Y-1)and(X+1, Y-1).

0987. Vertical Order Traversal of a Binary Tree (M)

Vertical Order Traversal of a Binary Tree (M) 題目 Given a binary tree, return the vertical order traversal of its nodes values.

987. Vertical Order Traversal of a Binary Tree - Medium

Given a binary tree, return thevertical ordertraversal of its nodesvalues. For each node at position(X, Y), its left and right children respectivelywill be at positions(X-1, Y-1)and(X+1, Y-1).

[LeetCode] 958. Check Completeness of a Binary Tree 檢查二叉樹的完全性

Given a binary tree, determine if it is acomplete binary tree. Definition of a complete binary tree fromWikipedia:

366. Find Leaves of Binary Tree

相關推薦