AVL tree realization: avl tree is left to each node subtree and right subtree height difference up to 1 binary search tree. a height of at least h of AVL tree nodes from S (h) = S (h-1)+ S (h-2)+ 1 received. avl tree to ensure that any one node subtree about the difference between the height of the absolute value of not more than one (empty tree for high-definition 1). in the insertion and deleted when you need according to the circumstances of the tree node to do some adjustments

Packet : 75448179avl_tree.rar filelist
avl_tree.h
avl_tree实现说明.doc

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