rect_tree_free()

void rect_tree_free

(

RECT_NODE *

node

)

Recurse from top of node tree and free all children.

does not free underlying point array.

Definition at line 42 of file lwtree.c.

References rect_node::left_node, lwfree(), rect_tree_free(), and rect_node::right_node.

Referenced by rect_tree_free(), test_rect_tree_contains_point(), and test_rect_tree_intersects_tree().

{
        if ( node->left_node )
        {
                rect_tree_free(node->left_node);
                node->left_node = 0;
        }
        if ( node->right_node )
        {
                rect_tree_free(node->right_node);
                node->right_node = 0;
        }
        lwfree(node);
}

Here is the call graph for this function:

Here is the caller graph for this function: