二叉树基本操作的程序实验
1、二叉树结点结构体
2、二叉树结点队列-Experimental procedure for the basic operation of a binary tree
1, a binary tree node structure
2, a binary tree node queue
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001367s ]
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.087751s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001272s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001912s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001389s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003650s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001124s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003292s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.016267s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001478s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 220569 [ RunTime:0.001450s ]
