[LeetCode] Binary Trees With Factors 帶因子的二叉樹
Given an array of unique integers, each integer is strictly greater than 1. We make a binary tree using these integers and each number may ...
原文：[LeetCode] 951. Flip Equivalent Binary Trees 翻轉等價二叉樹
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees. A binary tree Xisflip equivalentto a binary tree Y if and only if we can m ...
2020-07-02 15:00 0 881 推薦指數：
相關推薦
[LeetCode] 971. Flip Binary Tree To Match Preorder Traversal 翻轉二叉樹以匹配先序遍歷
Given a binary tree with N nodes, each node has a different value from {1, ..., N}. A node in this binary tree can be flipped by swapping the left ...
[LeetCode] Invert Binary Tree 翻轉二叉樹
Invert a binary tree. to Trivia: This problem was inspired by this original tweet by Max Howell: Google: 90% of our engineers use ...
[LeetCode] 617. Merge Two Binary Trees 合並二叉樹
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others ...
[LeetCode] 894. All Possible Full Binary Trees 所有可能的滿二叉樹
A *full binary tree* is a binary tree where each node has exactly 0 or 2 children. Return a list of all possible full binary trees with Nnodes. ...
[LeetCode] 968. Binary Tree Cameras 二叉樹相機
Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and its immediate ...
[LeetCode] Diameter of Binary Tree 二叉樹的直徑
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath ...
[LeetCode] 545. Boundary of Binary Tree 二叉樹的邊界
Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary, leaves ...