1,451
社区成员
发帖
与我相关
我的任务
分享请发表友善的回复…
发表回复
danielpan 2004-04-03
- 打赏
- 举报
递归阿,先遍历其左子树的所有节点,然后遍历本树的根节点,再遍历其右子树的所有节点.
这是二叉树的中序遍历
这是二叉树的中序遍历
lihonggen0 2004-04-02
- 打赏
- 举报
http://expert.csdn.net/Expert/FAQ/FAQ_Index.asp?id=124893
sickleliu 2004-04-02
- 打赏
- 举报
什么节点啊？问题问的没头没脑的
华芸智森 2004-04-02
- 打赏
- 举报
Private Function FindNode(NodeX As Node)
Dim N As Long
Dim StrSql As String
Dim MoNode() As Node
Dim AddId As Long
Dim TmpNode As Node
If NodeX.Children > 0 Then
AddId = 0
N = NodeX.Child.Index
If TrvName.Nodes(N).Children > 0 Then
AddId = AddId + 1
ReDim Preserve MoNode(AddId)
Set MoNode(AddId - 1) = TrvName.Nodes(N)
Else
Set TmpNode = TrvName.Nodes(N)
End If
While N <> NodeX.Child.LastSibling.Index
N = TrvName.Nodes(N).Next.Index
If TrvName.Nodes(N).Children > 0 Then
AddId = AddId + 1
ReDim Preserve MoNode(AddId)
Set MoNode(AddId - 1) = TrvName.Nodes(N)
Else
Set TmpNode = TrvName.Nodes(N)
End If
Wend
If AddId > 0 Then
For N = 0 To AddId - 1
Call FindNode(MoNode(N))
Next
End If
End If
End Function
Dim N As Long
Dim StrSql As String
Dim MoNode() As Node
Dim AddId As Long
Dim TmpNode As Node
If NodeX.Children > 0 Then
AddId = 0
N = NodeX.Child.Index
If TrvName.Nodes(N).Children > 0 Then
AddId = AddId + 1
ReDim Preserve MoNode(AddId)
Set MoNode(AddId - 1) = TrvName.Nodes(N)
Else
Set TmpNode = TrvName.Nodes(N)
End If
While N <> NodeX.Child.LastSibling.Index
N = TrvName.Nodes(N).Next.Index
If TrvName.Nodes(N).Children > 0 Then
AddId = AddId + 1
ReDim Preserve MoNode(AddId)
Set MoNode(AddId - 1) = TrvName.Nodes(N)
Else
Set TmpNode = TrvName.Nodes(N)
End If
Wend
If AddId > 0 Then
For N = 0 To AddId - 1
Call FindNode(MoNode(N))
Next
End If
End If
End Function
RealFox2000 2004-04-02
- 打赏
- 举报
抱歉了大家！！！我是想问如何遍历Tree上某节点下的所有子节点。
danielpan 2004-04-02
- 打赏
- 举报
你什么数据结构阿,就遍历节点!
