This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It's amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary tree can be fragmented and be extremely un balanced (as the algorithm does not do any balanc ing step) so the tree also needs a way for balanci Vi the nodes. I tried to reduce the memory consum ption by grouping three nodes into one new "int" node.

MainFrm.cpp
MainFrm.h
PrtTView.cpp
PrtTView.dsp
PrtTView.h
PrtTView.rc
PrtTViewDoc.cpp
PrtTViewDoc.h
PrtTViewView.cpp
PrtTViewView.h
ReadMe.txt
Release
.......\PrtTView.exe
res

...\PrtTView.rc2


...\tree_ico.bmp
resource.h
StdAfx.cpp
StdAfx.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．