实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001523s ]
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.096646s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001333s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001423s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001201s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003296s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000966s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004091s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014414s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001084s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 118382 [ RunTime:0.015440s ]
