最优查找二叉树和红黑树算法，可调整数据输入规模，打印树结构和总权值-Find the optimal binary tree and red-black tree algorithm, adjust the scale of data entry, printing tree structure and the total weight
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002550s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.123575s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002547s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002092s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002524s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003796s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002159s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003527s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014675s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002681s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 176387 [ RunTime:0.001212s ]
