这是一个实现二叉树的小程序，他的实现是实现左右二叉树中的一些难题，
值的一看哦-This is the realization of a binary tree small program, he is about to achieve some of the binary tree problems a value of the FACT
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.002149s ]
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.086163s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002447s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002007s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002249s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003689s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002031s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003252s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014390s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002437s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 158324 [ RunTime:0.001159s ]
