非递归创建二叉树.并且用非递归算法实现对二叉树的前序、中序、后序和广度遍历。
实现语言:C-Create a binary tree non-recursive. And the use of non-recursive algorithm for binary tree of the former order, in sequence, after the traversal sequence and breadth. Implementation language: C
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.003774s ]
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.091412s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.002602s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.002130s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.002266s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.004068s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.002366s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003721s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016590s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002715s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 241655 [ RunTime:0.001300s ]
