二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001390s ]
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.088235s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001413s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001930s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001234s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003683s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001066s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003299s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015111s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001477s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 184687 [ RunTime:0.001360s ]
