qq_42836798的博客

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given binary tre...

这题不能只将104求最大深度的代码改成小于号，即int minDepth(TreeNode* root){ if(!root) return 0; int left=minDepth(root->left); int right=minDepth(root->right); return 1+(left<right?left...

取数组[left,right]中间点mid=(left+right)/2作为根结点，并将原数组划分为[left,mid-1],[mid+1,right]两个子数组。将两子数组递归结果赋值给根的左右指针域。*注意，双分支递归不宜直接改用循环。

A binary tree is univalued if every node in the tree has the same value.Return trueif and only if the given tree is univalued.来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/univalued-binary-...