hex_trees module¶
-
class
hex_trees.Node(hx, value)¶ Bases:
objectClass Node
-
class
hex_trees.Tree¶ Bases:
objectClass tree will provide a tree as well as utility functions.
-
create_node(hx, data)¶ Utility function to create a node.
-
delete_node(node, data)¶ Delete function will delete a node into tree. Not complete , may need some more scenarios For now it is handling only the leaf.
-
insert(node, hx, data)¶ Insert function will insert a node into tree, at the right place determined by the value of data
-
print_inorder(root)¶ traverse function will return all the nodes in the tree in the sorted order of data
-
return_hex_inorder(root, hx_list)¶ traverse function will return all the nodes in the tree in the sorted order of node values
Node values were given during creation
-
search(node, data)¶ Search function will search a node into tree.
-
traverse_inorder(root, inorder)¶ traverse function will return all the nodes in the tree in the sorted order of data
-
traverse_postorder(root)¶ traverse function will print all the node in the tree.
-
traverse_preorder(root)¶ traverse function will print all the node in the tree.
-
-
hex_trees.create_hex_list_along_cube_coords(hg, value_flag)¶