
Introduction
For more than a year and a half I have had to use some kind of multi-node tree to do something. However, all I found from the Internet are binary trees or equivalents. I therefore decided to write my own. Because I had to finish it pretty fast, I spent only two days for it, so it may be buggy.
In the project, it has three classes working like in STL container-iterator style.template < class Key, class T > class Tree template < class Key, class T > class Tree_iterator template < class Key, class T > class TreeNode
A tree contains many tree nodes, while tree nodes contain data. Tree nodes of a tree are called children. In the design each node is assigned a level and the root node is of level 1.
Tree_iterator
is for navigation within the tree. Two tree-walk styles are defined. One walks down from the root node, while the other one use post-style to walk through all children of the tree. For each walk action, a
tree_iterator
is returned, so the user can use the iterator to reference the tree node and get the data.
I wrapped all the classes under the namespace Tiffany. For example, declaration of the tree with key type of
wstring
, and node data type of string, and add two levels of element is like:
Tiffany::Tree < wstring, string > x(L " Node 1" , " Root" ); px = x.AddChild(L " Key1" , " A" ); px1 = x.AddChild(px, L " Key2" , " 1" );
For a walk down action, you can limit it to a part of a tree ("sub-tree") by using the function
SetSubTreePivot(px)
, and you can set the pivot to point back to the root node by calling SetWalkDownRootPivot. Try it out!. You can even delete part of the tree by calling
DelSubTree()
.
Unfortunately I didn't have much time to prepare this document, but it should be obvious how to the classes.
<!-- Main Page Contents End -->License
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
About the Author
更多文章、技術交流、商務合作、聯(lián)系博主
微信掃碼或搜索:z360901061

微信掃一掃加我為好友
QQ號聯(lián)系: 360901061
您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點擊下面給點支持吧,站長非常感激您!手機微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點擊微信右上角掃一掃功能,選擇支付二維碼完成支付。
【本文對您有幫助就好】元
