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 are not. You need to merge them into a new binary tree ...
2017-06-21 12:18 0 9565 推荐指数：
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 ...
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 ...
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 ...
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. ...
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 ...
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 ...
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. ...
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 ...
