实现二叉树的后序的递归和非递归算法。
包括构造函数和析构函数。-After the realization of the sequence of binary tree recursive and non-recursive algorithm. Including the constructor and destructor.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001093s ]
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.064471s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001168s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001368s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002823s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003357s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000940s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003899s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015828s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001590s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 190091 [ RunTime:0.010634s ]
