In computer science, a two tree is a tree structure with a maximum of two subtrees for each node. Usually subtrees are called "left subtree" and "right subtree". Two forked trees are often used to implement two fork search trees and two forked heaps. The thought, depth, height of the two forked tree and the traversal of the two forked tree have deeply affected the development of computer science. This time, we use the two fork tree to realize the word that read a file, then build a two fork search tree, then output the height of two fork search tree, Ye Zishu and other information, and achieve the order traversal. Using a two fork search tree, a large number of words can be quickly arranged and the performance is very high.

Filename	Size	Update
searchBinTree	0	2016-12-17
searchBinTree\binTree.c	439	2016-12-17
searchBinTree\binTree.h	357	2016-12-17
searchBinTree\handle.c	939	2016-12-17
searchBinTree\main.c	1235	2016-12-17
searchBinTree\makefile	186	2016-12-17
searchBinTree\output.txt	244	2016-12-17
searchBinTree\tst.txt	43	2016-12-17

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