https://blog.youkuaiyun.com/scorecplzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/scorecpl/article/details/146036779https://blog.youkuaiyun.com/scorecpl/article/details/146036779scorecplThu, 06 Mar 2025 03:37:08 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145942253https://blog.youkuaiyun.com/scorecpl/article/details/145942253scorecplTue, 04 Mar 2025 12:01:38 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145918207https://blog.youkuaiyun.com/scorecpl/article/details/145918207scorecplFri, 28 Feb 2025 14:35:03 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145898001https://blog.youkuaiyun.com/scorecpl/article/details/145898001scorecplThu, 27 Feb 2025 13:08:54 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145868110https://blog.youkuaiyun.com/scorecpl/article/details/145868110scorecplWed, 26 Feb 2025 13:17:51 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145842921https://blog.youkuaiyun.com/scorecpl/article/details/145842921scorecplTue, 25 Feb 2025 11:46:25 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145840025https://blog.youkuaiyun.com/scorecpl/article/details/145840025scorecplTue, 25 Feb 2025 08:12:52 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145825903https://blog.youkuaiyun.com/scorecpl/article/details/145825903scorecplMon, 24 Feb 2025 13:05:43 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145775905https://blog.youkuaiyun.com/scorecpl/article/details/145775905scorecplMon, 24 Feb 2025 12:35:06 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145768023https://blog.youkuaiyun.com/scorecpl/article/details/145768023scorecplFri, 21 Feb 2025 13:54:41 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145740298https://blog.youkuaiyun.com/scorecpl/article/details/145740298scorecplThu, 20 Feb 2025 10:19:09 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145719296https://blog.youkuaiyun.com/scorecpl/article/details/145719296scorecplWed, 19 Feb 2025 13:47:34 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145679730https://blog.youkuaiyun.com/scorecpl/article/details/145679730scorecplMon, 17 Feb 2025 12:35:29 +0800 right时， 递归结束。二叉树的结构使得绝大部分的二叉树问题都可以用递归来解决。按照右中左的顺序遍历，需要pre来记录前一个访问的节点进行累加。对节点进行操作时，可能需要一个pre指针记录前一个访问的节点。2、终止条件是什么？3、单层逻辑是什么？]]>https://blog.youkuaiyun.com/scorecpl/article/details/145645213https://blog.youkuaiyun.com/scorecpl/article/details/145645213scorecplMon, 17 Feb 2025 11:45:18 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145623832https://blog.youkuaiyun.com/scorecpl/article/details/145623832scorecplFri, 14 Feb 2025 23:50:59 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145603045https://blog.youkuaiyun.com/scorecpl/article/details/145603045scorecplThu, 13 Feb 2025 05:48:18 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145583550https://blog.youkuaiyun.com/scorecpl/article/details/145583550scorecplThu, 13 Feb 2025 02:57:53 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145561936https://blog.youkuaiyun.com/scorecpl/article/details/145561936scorecplTue, 11 Feb 2025 05:54:05 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145540335https://blog.youkuaiyun.com/scorecpl/article/details/145540335scorecplTue, 11 Feb 2025 01:00:49 +0800https://blog.youkuaiyun.com/scorecpl/article/details/145505020https://blog.youkuaiyun.com/scorecpl/article/details/145505020scorecplSat, 08 Feb 2025 05:08:36 +0800 right child 的顺序。思路： 用queue 逐层地，从左到右储存节点，然后依次弹出，记录节点的值，并把左右child 继续储存到queue。顺序存储 ： 用数组， 如果父节点的数组下标是 i，它的左孩子是 i * 2 + 1，右孩子是 i * 2 + 2。通过标记， 代码可以统一，只是push 左中右node的顺序不同。思路： 标记出要处理的节点，统一。]]>