class documentation

class BinaryEulerTour(EulerTour):

Known subclasses: dsap.trees.euler_tour_examples.BinaryLayout

View In Hierarchy

Abstract base class for performing Euler tour of a binary tree.

This version includes an additional _hook_invisit that is called after the tour of the left subtree (if any), yet before the tour of the right subtree (if any).

Note: Right child is always assigned index 1 in path, even if no left sibling.

Method _hook_invisit Visit Position p, between tour of its left and right subtrees.
Method _tour Undocumented
def _hook_invisit(self, p, d, path):

Visit Position p, between tour of its left and right subtrees.

def _tour(self, p, d, path):

Undocumented