Introduction - If you have any usage issues, please Google them yourself
A tree control on the operation speed (add, delete, sort) to optimize the example, when a large number of tree nodes in operation, this method can be significantly faster than conventional methods of ten times or even several times
Packet : 17869349rgtreedemo.zip filelist
RGTreeDemo/
RGTreeDemo/res/
RGTreeDemo/resource.h
RGTreeDemo/res/TreeDlg.ico
RGTreeDemo/res/TreeDlg.rc2
RGTreeDemo/RGTree/
RGTreeDemo/RGTree/res/
RGTreeDemo/RGTree/Resource.h
RGTreeDemo/RGTree/res/RGTree.rc2
RGTreeDemo/RGTree/RGTree.cpp
RGTreeDemo/RGTree/RGTree.def
RGTreeDemo/RGTree/RGTree.dsp
RGTreeDemo/RGTree/RGTree.dsw
RGTreeDemo/RGTree/RGTree.rc
RGTreeDemo/RGTree/RGTreeCtrl.cpp
RGTreeDemo/RGTree/RGTreeCtrl.h
RGTreeDemo/RGTree/RGTreeT.h
RGTreeDemo/RGTree/StdAfx.cpp
RGTreeDemo/RGTree/StdAfx.h
RGTreeDemo/RightTreeCtrl.cpp
RGTreeDemo/RightTreeCtrl.h
RGTreeDemo/StdAfx.cpp
RGTreeDemo/StdAfx.h
RGTreeDemo/TreeDlg.cpp
RGTreeDemo/TreeDlg.dsp
RGTreeDemo/TreeDlg.dsw
RGTreeDemo/TreeDlg.h
RGTreeDemo/TreeDlg.rc
RGTreeDemo/TreeDlgDlg.cpp
RGTreeDemo/TreeDlgDlg.h