zoukankan
html css js c++ java
about treeview
using
..;
namespace
WebApp
{
public
partial
class
_Default : System.Web.UI.Page
{
TreeNode node;
protected
void
Page_Load(
object
sender, EventArgs e)
{
BindTree();
}
private
void
BindTree()
{
string
cmdText
=
"
SELECT AreaID,Name FROM Area WHERE substring(AreaID,3,4)='0000'
"
;
using
(SqlDataReader dr
=
SqlHelper.ExcuteReader(ConfigurationManager.ConnectionStrings[
"
SqlConn
"
].ConnectionString, cmdText,
null
))
{
while
(dr.Read())
{
node
=
new
TreeNode();
node.Text
=
dr.GetString(
1
);
node.Value
=
dr.GetString(
0
);
node.NavigateUrl
=
"
page.html?id=
"
+
dr.GetString(
0
);
node.Target
=
"
_blank
"
;
TreeView1.Nodes.Add(node);
GetChilds(dr.GetString(
0
));
}
}
}
private
void
GetChilds(
string
parentid)
{
string
cmdText
=
"
SELECT AreaID,Name FROM Area WHERE substring(AreaID,1,2)='
"
+
parentid.Substring(
0
,
2
)
+
"
' AND substring(AreaID,5,2)='00'
"
;
using
(SqlDataReader dr
=
SqlHelper.ExcuteReader(ConfigurationManager.ConnectionStrings[
"
SqlConn
"
].ConnectionString, cmdText,
null
))
{
while
(dr.Read())
{
TreeNode cnode
=
new
TreeNode();
cnode.Text
=
dr.GetString(
1
);
cnode.NavigateUrl
=
"
subpage.html?id=
"
+
dr.GetString(
0
);
cnode.Target
=
"
_blank
"
;
node.Expanded
=
false
;
node.ChildNodes.Add(cnode);
}
}
}
protected
void
TreeView1_SelectedNodeChanged(
object
sender, EventArgs e)
{
TreeView1.SelectedNode.Expanded
=
true
;
}
}
}
查看全文
相关阅读:
Netty5.x中新增和值得注意的点(转载http://www.coderli.com/netty-5-new-and-noteworthy/)
PAT A1143 Lowest Common Ancestor [二叉搜索树LCA]
PAT A1136 A Delayed Palindrome [大数加法]
PAT A1047 Student List for Course [字符串映射]
PAT A1022 Digital Library [输入输出 STL]
输入输出格式总结
算法题面生词汇总
PAT A1044 Shopping in Mars [二分]
PAT A1010 Radix [二分]
算法的时间复杂度分析
原文地址:https://www.cnblogs.com/yiki/p/777250.html
最新文章
站立会议报告(1)
拦截器、过滤器的区别
Java poi简单操作
easypoI模板导出
datagrid 数据表格的高度处理
`符号在sql语句中的作用
简单爬虫的编写
谷歌浏览器调试工具的使用
response实现文件的下载
Python的学习心得
热门文章
一个简单的文本查询程序
两个stack实现一个queue
实现stack 加上·getMin功能 时间复杂度为O(n)
最大累加矩阵大小
矩阵的最小路径和
编辑掉
子数组最大累加和
折纸问题
最长递增子序列
Netty组件理解(转载)
Copyright © 2011-2022 走看看