Searched refs:tree_ptr (Results 1 – 10 of 10) sorted by relevance
12 typedef struct bin_tree_struct * tree_ptr; typedef16 tree_ptr data;21 void search_tree_insert (tree_ptr *, int);22 void pre_order_traverse (tree_ptr);23 void pre_order_traverse_no_recurse (tree_ptr);24 void in_order_traverse (tree_ptr);25 void in_order_traverse_no_recurse (tree_ptr);26 void push (struct stack_struct **, tree_ptr);27 tree_ptr pop (struct stack_struct **);
4 tree_ptr7 tree_ptr node = (tree_ptr) malloc (sizeof (tree_ptr)); in new_node()15 search_tree_insert (tree_ptr *root, int value) in search_tree_insert()
5 tree_ptr12 tree_ptr value = (*stack)->data; in pop()19 push (struct stack_struct **stack, tree_ptr value) in push()
6 real_pre_order_traverse_no_recurse (tree_ptr root)15 tree_ptr current = pop (&stack);24 pre_order_traverse_no_recurse (tree_ptr root)
6 real_pre_order_traverse_no_recurse (tree_ptr root)15 tree_ptr current = pop (&stack);26 pre_order_traverse_no_recurse (tree_ptr root)
6 real_in_order_traverse_no_recurse (tree_ptr root)9 tree_ptr current= root;36 in_order_traverse_no_recurse (tree_ptr root)
6 real_preorder (tree_ptr root) in real_preorder()18 pre_order_traverse (tree_ptr root) in pre_order_traverse()
6 real_inorder (tree_ptr root) in real_inorder()17 in_order_traverse (tree_ptr root) in in_order_traverse()
17 tree_ptr root = NULL; in main()