帮助分割2-3树，C ++中的节点 [英] Help in splitting nodes in a 2-3 Tree, C++

问题描述

大家好！我需要一些关于我的项目的帮助，这是一个用C ++编程的2-3树的实现。



我的问题是在每个节点，我要去有2个数据项，我需要的是，当我点击任何有2个数据项的节点时，我想拆分该节点，所以中间数据项上升，我们添加子项。在这种情况下如何拆分节点?????

Hello everyone !!! I need some help on my project, which is an implementation of a 2-3 tree in C++ programming.

My problem is that in every node, i am going to have 2 data items, and what i need is that when i hit any node with 2 data items, i want to split that node, so the middle data item goes up, and we add the children. How can I split the node in this case ?????

推荐答案

有点令人困惑。您可以为树项提供DWORD数据。使用对象指针。



回复消息：



http://msdn.microsoft.com/de-de/library/38x8htxs（v = VS.90 ）.aspx [ ^ ]



您需要详细信息selchanged msg



http://msdn.microsoft.com/en-us /library/windows/desktop/bb773544(v=vs.85).aspx [ ^ ]

a little confusing. You can give the tree items a DWORD data. Use an object pointer for that.

Respond to the messages:

http://msdn.microsoft.com/de-de/library/38x8htxs(v=vs.90).aspx[^]

you need the details to the "selchanged msg"

http://msdn.microsoft.com/en-us/library/windows/desktop/bb773544(v=vs.85).aspx[^]

这篇关于帮助分割2-3树，C ++中的节点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！