在二叉树中查找值为X的结点，试设计打印值为X的结点的所有祖先的算法-In the binary tree to find a value of X, node, trial designed to print the value of X, all the ancestor nodes the algorithm
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001018s ]
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.074271s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000944s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001164s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000890s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003044s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.003574s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003990s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014752s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.000962s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 220308 [ RunTime:0.015207s ]
