polynomials_on_simplices.geometry.space_partitioning.tree_traversal module

Functionality for navigating through a tree.

get_descendant_by_address(tree_node, relative_address)

Get the descendant node with given address relative to the given tree node.

A relative address with respect to a tree node is a list of successive children to traverse to reach the desired descendant. For example:

[0] is the address of the first child of the given tree node. [1, 2] is the address of the third child of the second child of the given tree node.

Parameters:

• tree_node – Tree node whose descendant we want to get.
• relative_address (List[int]) – Relative address to the descendant we want to get.

get_node_by_address(root_node, address)

Get the node in the given tree with the given address.

An address in the tree is a list of sibling indices. For example:

[0] gives the root node. [0, 1] gives the second (zero-based indexing) child node of the root node. [0, 1, 0] gives the first child node of the second child node of the root node.

Parameters:

• root_node – Root node of the tree we want to traverse.
• address (List[int]) – Address to the tree node we want to get.