https://blog.youkuaiyun.com/bili_orangezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/bili_orange/article/details/131220767https://blog.youkuaiyun.com/bili_orange/article/details/131220767bili_orangeTue, 27 Jun 2023 09:41:47 +0800https://blog.youkuaiyun.com/bili_orange/article/details/131100610https://blog.youkuaiyun.com/bili_orange/article/details/131100610bili_orangeThu, 15 Jun 2023 09:18:49 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130989003https://blog.youkuaiyun.com/bili_orange/article/details/130989003bili_orangeThu, 08 Jun 2023 09:14:55 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130778377https://blog.youkuaiyun.com/bili_orange/article/details/130778377bili_orangeWed, 31 May 2023 21:00:30 +0800left或root->right接收NULL是正确的；5.要删除的节点左右孩子均不为空，可以把左子树并到右子树上，也可以把右子树并到左子树上，是一样的，选一种即可。具体方法是使用两个指针，比较前后元素是否相同（根据题目中给出的性质，相同的元素一定是相邻的），如果相同，就count+1，不同的话count=1。那就不设置最大值了，]]>https://blog.youkuaiyun.com/bili_orange/article/details/130648951https://blog.youkuaiyun.com/bili_orange/article/details/130648951bili_orangeSat, 20 May 2023 10:04:39 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130567347https://blog.youkuaiyun.com/bili_orange/article/details/130567347bili_orangeFri, 12 May 2023 17:31:21 +0800类型的数组来存放路径的节点（用vector是因为回溯的时候比较方便），还需要一个vector类型的数组来存放符合要求的带->的最终结果。因为是从下往上遍历，中间节点的高度需要参考左右孩子的高度，所以是先求左右孩子高度，再向上返回结果计算中间节点的高度。因为代码的逻辑实际上是求根节点的高度，根节点的高度就是二叉树的最大深度，所以用的是求高度的后序遍历。，因为要通过左右孩子（即内侧和外侧节点）的比较结果，来判断这两棵子树是否对称。]]>https://blog.youkuaiyun.com/bili_orange/article/details/130329559https://blog.youkuaiyun.com/bili_orange/article/details/130329559bili_orangeMon, 08 May 2023 17:22:36 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130351495https://blog.youkuaiyun.com/bili_orange/article/details/130351495bili_orangeMon, 24 Apr 2023 21:07:00 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130160995https://blog.youkuaiyun.com/bili_orange/article/details/130160995bili_orangeSun, 23 Apr 2023 20:14:29 +0800https://blog.youkuaiyun.com/bili_orange/article/details/130068982https://blog.youkuaiyun.com/bili_orange/article/details/130068982bili_orangeFri, 14 Apr 2023 19:57:11 +0800https://blog.youkuaiyun.com/bili_orange/article/details/129975808https://blog.youkuaiyun.com/bili_orange/article/details/129975808bili_orangeMon, 10 Apr 2023 20:00:35 +0800https://blog.youkuaiyun.com/bili_orange/article/details/129865154https://blog.youkuaiyun.com/bili_orange/article/details/129865154bili_orangeWed, 05 Apr 2023 19:42:55 +0800https://blog.youkuaiyun.com/bili_orange/article/details/129757118https://blog.youkuaiyun.com/bili_orange/article/details/129757118bili_orangeFri, 31 Mar 2023 19:58:26 +0800https://blog.youkuaiyun.com/bili_orange/article/details/129763185https://blog.youkuaiyun.com/bili_orange/article/details/129763185bili_orangeSat, 25 Mar 2023 16:47:50 +0800