tree_print(3f) - [M_sort] print a sorted integer tree generated by tree_insert(3f) (LICENSE:MIT)
Synopsis
Description
Author
Examples
subroutine tree_print(t)
type(tree_node), pointer :: t
Print a tree of sorted integers created by insert_tree(3f).
Copyright (c) 1990 by Walter S. Brainerd, Charles H. Goldberg, and Jeanne C. Adams. This code may be copied and used without restriction as long as this notice is retained.
sample program
program tree_sort use M_sort, only : tree_node, tree_insert, tree_print implicit none type(tree_node), pointer :: t ! A tree integer :: number integer :: ios nullify(t) ! Start with empty tree infinite: do read (*,*,iostat=ios) number if(ios.ne.0)exit infinite call tree_insert(t,number) ! Put next number in tree enddo infinite call tree_print(t) ! Print nodes of tree in infix order end program tree_sort
Nemo Release 3.1 | tree_print (3) | February 23, 2025 |