我有两棵树Tree1和Tree2,其中Tree2是Tree1的子集。另外一个HTREEITEM hItem存放的是Tree1中的一个句柄。现在想根据这个句柄更新Tree2,并使得Tree2仍旧是Tree1的子集。比如:
Tree1:
ROOT
+----T1
| +----T12
| +---T121
| +---T122
+----T2
+---T21
+---T22
Tree2:
空当hItem=T121时,Tree2为:
ROOT
+----T1
+----T12
+---T121当hItem=T2时,Tree2变为:
ROOT
+----T1
| +----T12
| +---T121
+----T2求一个好算法呀
Tree1:
ROOT
+----T1
| +----T12
| +---T121
| +---T122
+----T2
+---T21
+---T22
Tree2:
空当hItem=T121时,Tree2为:
ROOT
+----T1
+----T12
+---T121当hItem=T2时,Tree2变为:
ROOT
+----T1
| +----T12
| +---T121
+----T2求一个好算法呀
2。遍历以HITEM为根的树,以相应的接点内容新建tree2即可
还是自己写代码吧,这样会深刻一些的