地址 https://leetcode-cn.com/contest/weekly-contest-163/problems/find-elements-in-a-contaminated-binary-tree/ 题目描述给出一个满足下述规则的二叉树： root.val ...

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 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 ...

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 ...

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree ...