https://blog.youkuaiyun.com/Luckxuanzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Luckxuan/article/details/150400312https://blog.youkuaiyun.com/Luckxuan/article/details/150400312LuckxuanThu, 14 Aug 2025 20:27:49 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/150400268https://blog.youkuaiyun.com/Luckxuan/article/details/150400268LuckxuanThu, 14 Aug 2025 20:24:18 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/149779985https://blog.youkuaiyun.com/Luckxuan/article/details/149779985LuckxuanWed, 30 Jul 2025 16:12:44 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/149779442https://blog.youkuaiyun.com/Luckxuan/article/details/149779442LuckxuanWed, 30 Jul 2025 15:57:25 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/149405265https://blog.youkuaiyun.com/Luckxuan/article/details/149405265LuckxuanWed, 16 Jul 2025 18:54:03 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/148866064https://blog.youkuaiyun.com/Luckxuan/article/details/148866064LuckxuanTue, 24 Jun 2025 10:26:56 +0800 T multiplies 乘法仿函数。template T plus 加法仿函数。template T divides 除法仿函数。template T modulus 取模仿函数。template T negate 取反仿函数。template T minus 减法仿函数。]]>https://blog.youkuaiyun.com/Luckxuan/article/details/148864662https://blog.youkuaiyun.com/Luckxuan/article/details/148864662LuckxuanTue, 24 Jun 2025 09:41:40 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/148377993https://blog.youkuaiyun.com/Luckxuan/article/details/148377993LuckxuanMon, 02 Jun 2025 09:18:02 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/148352915https://blog.youkuaiyun.com/Luckxuan/article/details/148352915LuckxuanSat, 31 May 2025 16:19:10 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/148316723https://blog.youkuaiyun.com/Luckxuan/article/details/148316723LuckxuanThu, 29 May 2025 19:45:42 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/148194644https://blog.youkuaiyun.com/Luckxuan/article/details/148194644LuckxuanSat, 24 May 2025 18:59:11 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/147878508https://blog.youkuaiyun.com/Luckxuan/article/details/147878508LuckxuanSun, 11 May 2025 20:29:01 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/147234005https://blog.youkuaiyun.com/Luckxuan/article/details/147234005LuckxuanMon, 14 Apr 2025 22:01:25 +08000 有且只有一个没有前驱的节点，成为root；- 完全二叉树：分支节点的度都为2，叶子节点在后两层，除了最底下一层，上面是满二叉树。- 度：后继节点的个数，一个节点的度0 称为叶子节点，非零叫分支节点。- 边：连接相邻两个节点，路径任意两个节点之间边，路径唯一；- 满二叉树：分支节点的度都为2，叶子节点都在最后一层。- 高度：从节点到叶子节点路径中边的个数。叶子节点个数为n，分支节点个数为n-1。- 中序遍历（二叉树）- 子节点：后继节点 0~n。]]>https://blog.youkuaiyun.com/Luckxuan/article/details/146350495https://blog.youkuaiyun.com/Luckxuan/article/details/146350495LuckxuanTue, 18 Mar 2025 19:43:41 +0800size);printf("链表大小：%d\n", list->size);char data;printf("遍历：\n");// 尾指针指向头指针，链表为空。]]>https://blog.youkuaiyun.com/Luckxuan/article/details/146080630https://blog.youkuaiyun.com/Luckxuan/article/details/146080630LuckxuanThu, 06 Mar 2025 21:20:48 +0800 A是B的前驱，B是A的后继。数据对象：由属性相同的数据元素构成的集合。数据规模 n 增长与时间增长的`趋势`算法：解决问题的方法或步骤的描述。]]>https://blog.youkuaiyun.com/Luckxuan/article/details/144867550https://blog.youkuaiyun.com/Luckxuan/article/details/144867550LuckxuanWed, 01 Jan 2025 14:37:01 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/144787438https://blog.youkuaiyun.com/Luckxuan/article/details/144787438LuckxuanSat, 28 Dec 2024 12:39:41 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/144679650https://blog.youkuaiyun.com/Luckxuan/article/details/144679650LuckxuanMon, 23 Dec 2024 23:06:21 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/144534132https://blog.youkuaiyun.com/Luckxuan/article/details/144534132LuckxuanTue, 17 Dec 2024 14:05:47 +0800https://blog.youkuaiyun.com/Luckxuan/article/details/144491170https://blog.youkuaiyun.com/Luckxuan/article/details/144491170LuckxuanSun, 15 Dec 2024 19:34:59 +0800