110.平衡二叉树
题目:. - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
想要在一次遍历中获得每个结点的深度,采用后序遍历。遍历操作为判断该结点是否为二叉平衡树并计算该结点的深度,但是怎么同时返回两个值呢。。。
受到求最大最小深度启发,记录最大左右子树深度差绝对值
solution
public class Solution {
public int dis = 0;
public bool IsBalanced(TreeNode root) {
int depth = traversal(root);
return dis <= 1;
}
public int traversal(TreeNode node)
{
if(node == null) return 0;
int left = traversal(node.left);
int right = traversal(node.right);
dis = dis >= Math.Abs(left - right) ? dis : Math.Abs(left - right);
return left > right ? left + 1 : right + 1;
}
}
summary
257.二叉树的所有路径
题目:257. 二叉树的所有路径 - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
本题开始涉及到回溯的问题,在summary中列出错误代码和错误答案,添加回溯操作修正
solution
public class Solution {
List<string> paths = new List<string>();
public IList<string> BinaryTreePaths(TreeNode root) {
StringBuilder path = new StringBuilder();
traversal(root, path);
return paths;
}
public void traversal(TreeNode node, StringBuilder path)
{
int len = path.Length;
path.Append(node.val.ToString());
if (node.left == null && node.right == null)
{
paths.Add(path.ToString());
}
else
{
path.Append("->");
if(node.left != null) traversal(node.left, path);
if(node.right != null) traversal(node.right, path);
}
path.Length = len;
}
}
summary
错误:
所有递归都在共享一个StringBuilder对象
public class Solution {
List<string> paths = new List<string>();
public IList<string> BinaryTreePaths(TreeNode root) {
StringBuilder path = new StringBuilder();
traversal(root, path);
return paths;
}
public void traversal(TreeNode node, StringBuilder path)
{
if (node.left == null && node.right == null)
{
path.Append(node.val.ToString());
paths.Add(path.ToString());
}
path.Append(node.val.ToString());
path.Append("->");
if(node.left != null) traversal(node.left, path);
if(node.right != null) traversal(node.right, path);
}
}
404.左叶子之和
题目:404. 左叶子之和 - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
直觉思路是加一个左叶子节点的标记,,向左遍历则为true,向右遍历则为false
怪怪的,但管用。。。
solution
public class Solution {
int sum = 0;
public int SumOfLeftLeaves(TreeNode root) {
Traversal(root, false);
return sum;
}
public void Traversal(TreeNode root, bool isleft)
{
if(root.left == null && root.right == null)
{
sum += isleft ? root.val : 0;
return;
}
if(root.left != null) Traversal(root.left, true);
if(root.right != null) Traversal(root.right, false);
}
}
summary
222.完全二叉树的节点个数
题目:222. 完全二叉树的节点个数 - 力扣(LeetCode)
题解:代码随想录 (programmercarl.com)
用以往的遍历算法都可以解决,思考题目进阶中的更快的算法,完全二叉树的特性?
solution
public class Solution {
public int CountNodes(TreeNode root) {
if (root == null) return 0;
int leftHeight = GetHeight(root.left);
int rightHeight = GetHeight(root.right);
if (leftHeight == rightHeight) return (1 << leftHeight) + CountNodes(root.right);
return (1 << rightHeight) + CountNodes(root.left);
}
private int GetHeight(TreeNode node) {
int height = 0;
while (node != null) {
height++;
node = node.left;
}
return height;
}
}
summary
key:
利用完全二叉树的性质,通过计算树的高度判断某些子树是不是满的,从而避免遍历所有节点。