dsap.trees.tree.Tree.Position

class documentation

class Position:

Known subclasses: dsap.trees.linked_binary_tree.LinkedBinaryTree.Position

View In Hierarchy

An abstraction representing the location of a single element within a tree.

Note that two position instaces may represent the same inherent location in a tree. Therefore, users should always rely on syntax 'p == q' rather than 'p is q' when testing equivalence of positions.

Method __eq__ Return True if other Position represents the same location.
Method __ne__ Return True if other does not represent the same location.
Method element Return the element stored at this Position.
def __eq__(self, other):
overridden in dsap.trees.linked_binary_tree.LinkedBinaryTree.Position

Return True if other Position represents the same location.

def __ne__(self, other):

Return True if other does not represent the same location.

def element(self):
overridden in dsap.trees.linked_binary_tree.LinkedBinaryTree.Position

Return the element stored at this Position.