假设二叉树用链接存储结构进行存储，root指向根结点，p所指结点为任一给定的结点，编写一个求出从根结点到p所指结点之间路径的函数。-assumptions used to link storage structure for storage, root at Root, p referring to the node to a set of nodes, obtained from a prepared Root referred to p path between nodes function.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001000s ]
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.063884s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.000895s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001114s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001009s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003092s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000865s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003632s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015027s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001218s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 67607 [ RunTime:0.017222s ]
