Description: create a binary sort tree, and used the preorder and output levels traversal sequence its peak, the main contents are as follows : 1. Sort definition of two fork BiTree tree structure; 2. Ranking compiled binary tree insertion algorithm : void Insert_SortTree (BiTree ST ElemType x); 3. establishment preorder function; 4. in the main () function to complete binary tree in order to establish, and the Central preorder output. (2 forks ranking tree various elements from the keyboard input, and the use of Insert_SortTree () function to insert the establishment); 5. Traversing the preparation level functions, and the main () function to complete traverse the output level. Level traversal to using "queue" to achieve; This requires definition of a cohort structure (Queue chain can be use
- [98] - without passwords, directly extract, is
- [shortpath-ron] - C fork order to achieve two tree algorit
- [Soft20060210094429327] - pair of 256-color bmp image processing p
- [bianlioferchashu] - Binary Sort Tree Establishment and trave
- [btree] - Title 4. Binary Sort Tree Establishment,
- [vhdl] - 74ls164 8-bit shift register and a strin
File list (Check if you may need any files):
Download