[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] Binary Trees With Factors 带因子的二叉树
Given an array of unique integers, each integer is strictly greater than . We make a binary tree using these integersand each number may be used for any number of times. Each non leaf node svalue sho ...
2019-01-05 00:00 0 960 推荐指数：
相关推荐
[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 X ...
[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] 543. 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 longest path ...
[LeetCode] Print Binary Tree 打印二叉树
Print a binary tree in an m*n 2D string array following these rules: The row number m should be equal to the height of the given binary tree. ...
[LeetCode] Binary Tree Tilt 二叉树的坡度
Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference between the sum of all left ...
[LeetCode] Binary Tree Pruning 二叉树修剪
We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1. Return the same tree where every ...
[LeetCode] Balanced Binary Tree 平衡二叉树
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree ...