sqlserver实现树形结构递归查询(无限极分类)的方法

2020-07-04 06:04:24易采站长站整理

insert into tb_menu(id, title, parent) values(30, '二级菜单30',13);
insert into tb_menu(id, title, parent) values(31, '二级菜单31',14);
insert into tb_menu(id, title, parent) values(32, '二级菜单32',15);
insert into tb_menu(id, title, parent) values(33, '二级菜单33',16);
insert into tb_menu(id, title, parent) values(34, '二级菜单34',17);
insert into tb_menu(id, title, parent) values(35, '二级菜单35',18);
insert into tb_menu(id, title, parent) values(36, '二级菜单36',19);
insert into tb_menu(id, title, parent) values(37, '二级菜单37',20);

--三级菜单
insert into tb_menu(id, title, parent) values(38, '三级菜单38',21);
insert into tb_menu(id, title, parent) values(39, '三级菜单39',22);
insert into tb_menu(id, title, parent) values(40, '三级菜单40',23);
insert into tb_menu(id, title, parent) values(41, '三级菜单41',24);
insert into tb_menu(id, title, parent) values(42, '三级菜单42',25);
insert into tb_menu(id, title, parent) values(43, '三级菜单43',26);
insert into tb_menu(id, title, parent) values(44, '三级菜单44',27);
insert into tb_menu(id, title, parent) values(45, '三级菜单45',28);
insert into tb_menu(id, title, parent) values(46, '三级菜单46',28);
insert into tb_menu(id, title, parent) values(47, '三级菜单47',29);
insert into tb_menu(id, title, parent) values(48, '三级菜单48',30);
insert into tb_menu(id, title, parent) values(49, '三级菜单49',31);
insert into tb_menu(id, title, parent) values(50, '三级菜单50',31);
commit;

2.查找所有上级节点


--查询树状结构某节点(44)的上级所有根节点

with cte_parent(id,title,parent)

as

(

--起始条件

select id,title,parent

from tb_menu

where id = 44 --列出子节点查询条件

union all

--递归条件

select a.id,a.title,a.parent

from tb_menu a

inner join

cte_parent b --执行递归,这里就要理解下了

on a.id=b.parent

)

select * from cte_parent;

3.查找下级节点带level


--查询树状结构某节点下的所有子节点(

with cte_child(id,title,parent,level)

as

(

--起始条件

select id,title,parent,0 as level

from tb_menu

where id = 6--列出父节点查询条件

union all

--递归条件

select a.id,a.title,a.parent,b.level+1

from tb_menu a

inner join

cte_child b

on ( a.parent=b.id)

)

select * from cte_child;

以上这篇sqlserver实现树形结构递归查询(无限极分类)的方法就是小编分享给大家的全部内容了,希望能给大家一个参考,也希望大家多多支持软件开发网。

相关文章 大家在看