1, the dynamic lookup table of the three basic functions : Search, insert, and delete. 2, the initial, balanced binary tree is empty tree interface gives you, insert and delete operations for the three choices. Each operation will have to be me to input keywords. Each insert or delete a node, the update should show a balanced binary tree. 3, balanced binary tree shows that using the tree structure shown binary tree. 4, merging two balanced binary tree. 5, a balanced binary tree split into two balanced binary tree. made in a tree all the keywords are less than or equal to x, another one of the tree is better than a key x

平衡二叉树的演示.cpp
平衡二叉树的演示.dsp
平衡二叉树的演示.dsw
平衡二叉树的演示.ncb
平衡二叉树的演示.opt
平衡二叉树的演示.plg

• 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．