https://blog.youkuaiyun.com/Q_v_Rzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Q_v_R/article/details/132640154https://blog.youkuaiyun.com/Q_v_R/article/details/132640154Q_v_RSun, 03 Sep 2023 12:30:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132629685https://blog.youkuaiyun.com/Q_v_R/article/details/132629685Q_v_RSat, 02 Sep 2023 12:30:00 +0800，v,w是顶点，v为弧尾，w为弧头。E(G)是边的有限集合，边是顶点的无序对，记为（v,w）或（w,v)，并且（v,w)=(w,v)]]>https://blog.youkuaiyun.com/Q_v_R/article/details/132611247https://blog.youkuaiyun.com/Q_v_R/article/details/132611247Q_v_RFri, 01 Sep 2023 12:30:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132585601https://blog.youkuaiyun.com/Q_v_R/article/details/132585601Q_v_RThu, 31 Aug 2023 12:45:00 +0800=1)性质3：对任何一棵二叉树T，如果其终端结点数为n0，度为2的结点数为n2，则n0=n2+1特殊的二叉树a. 满二叉树: k层的二叉树具有2^k - 1个节点b. 完全二叉树: 深度为k，有n个结点的二叉树当且仅当其每一个结点都与深度为k的满二叉树中编号从1至n的结点一一对应时性质4：具有n个节点的完全二叉树的深度为logn + 1。]]>https://blog.youkuaiyun.com/Q_v_R/article/details/132514816https://blog.youkuaiyun.com/Q_v_R/article/details/132514816Q_v_RWed, 30 Aug 2023 22:15:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132569335https://blog.youkuaiyun.com/Q_v_R/article/details/132569335Q_v_RWed, 30 Aug 2023 12:30:00 +0800= pos;i--)链式表: 使用链表表示特点：用一组任意的存储单元存储线性表的数据元素(逻辑上相邻的元素在物理上可以不相邻)利用指针实现了用不相邻的存储单元存放逻辑上相邻的元素(只支持顺序访问)每个数据元素ai，除存储本身信息外，还需存储其直接后继的信息(需要额外的存储空间)]]>https://blog.youkuaiyun.com/Q_v_R/article/details/132514801https://blog.youkuaiyun.com/Q_v_R/article/details/132514801Q_v_RTue, 29 Aug 2023 12:45:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132514790https://blog.youkuaiyun.com/Q_v_R/article/details/132514790Q_v_RMon, 28 Aug 2023 12:30:00 +0800 ./test。]]>https://blog.youkuaiyun.com/Q_v_R/article/details/132514774https://blog.youkuaiyun.com/Q_v_R/article/details/132514774Q_v_RSun, 27 Aug 2023 12:15:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132514768https://blog.youkuaiyun.com/Q_v_R/article/details/132514768Q_v_RSat, 26 Aug 2023 18:50:16 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132514750https://blog.youkuaiyun.com/Q_v_R/article/details/132514750Q_v_RSat, 26 Aug 2023 18:48:55 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132483214https://blog.youkuaiyun.com/Q_v_R/article/details/132483214Q_v_RSat, 26 Aug 2023 12:30:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132482960https://blog.youkuaiyun.com/Q_v_R/article/details/132482960Q_v_RFri, 25 Aug 2023 12:30:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132482467https://blog.youkuaiyun.com/Q_v_R/article/details/132482467Q_v_RThu, 24 Aug 2023 21:23:51 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132461116https://blog.youkuaiyun.com/Q_v_R/article/details/132461116Q_v_RWed, 23 Aug 2023 21:28:24 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132422107https://blog.youkuaiyun.com/Q_v_R/article/details/132422107Q_v_RWed, 23 Aug 2023 21:06:21 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132415811https://blog.youkuaiyun.com/Q_v_R/article/details/132415811Q_v_RMon, 21 Aug 2023 21:13:32 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132378597https://blog.youkuaiyun.com/Q_v_R/article/details/132378597Q_v_RSun, 20 Aug 2023 12:15:00 +0800https://blog.youkuaiyun.com/Q_v_R/article/details/132376288https://blog.youkuaiyun.com/Q_v_R/article/details/132376288Q_v_RSat, 19 Aug 2023 12:21:52 +0800 该函 数保存结果，返回指向结果的指针。MYSQL_ROW mysql_fetch_row(MYSQL_RES *res) ---->从res指 向的结果中获取一行数据。返回值，包含错误信 息的字符串，---> 返回 列 数。my_ulonglong mysql_num_rows(MYSQL_RES *res)---->返回行 数。const char *db, ------> 要连接的数据库的名字： "mydb"MYSQL *mysql, ----> 上一个函数的返回值: conn。]]>https://blog.youkuaiyun.com/Q_v_R/article/details/132371433https://blog.youkuaiyun.com/Q_v_R/article/details/132371433Q_v_RFri, 18 Aug 2023 22:23:31 +0800