From 713a609bd19d491de03debf8a4a6ddf2540b13dc Mon Sep 17 00:00:00 2001 From: Scott Gasch Date: Thu, 3 Feb 2022 14:18:37 -0800 Subject: Change settings in flake8 and black. --- collect/bst.py | 18 ++++++++---------- 1 file changed, 8 insertions(+), 10 deletions(-) (limited to 'collect/bst.py') diff --git a/collect/bst.py b/collect/bst.py index 8602ce6..712683e 100644 --- a/collect/bst.py +++ b/collect/bst.py @@ -90,9 +90,7 @@ class BinarySearchTree(object): return self._find(value, node.right) return None - def _parent_path( - self, current: Optional[Node], target: Node - ) -> List[Optional[Node]]: + def _parent_path(self, current: Optional[Node], target: Node) -> List[Optional[Node]]: if current is None: return [None] ret: List[Optional[Node]] = [current] @@ -575,7 +573,11 @@ class BinarySearchTree(object): return self.depth() def repr_traverse( - self, padding: str, pointer: str, node: Optional[Node], has_right_sibling: bool + self, + padding: str, + pointer: str, + node: Optional[Node], + has_right_sibling: bool, ) -> str: if node is not None: viz = f'\n{padding}{pointer}{node.value}' @@ -590,9 +592,7 @@ class BinarySearchTree(object): else: pointer_left = "└──" - viz += self.repr_traverse( - padding, pointer_left, node.left, node.right is not None - ) + viz += self.repr_traverse(padding, pointer_left, node.left, node.right is not None) viz += self.repr_traverse(padding, pointer_right, node.right, False) return viz return "" @@ -628,9 +628,7 @@ class BinarySearchTree(object): else: pointer_left = "├──" - ret += self.repr_traverse( - '', pointer_left, self.root.left, self.root.left is not None - ) + ret += self.repr_traverse('', pointer_left, self.root.left, self.root.left is not None) ret += self.repr_traverse('', pointer_right, self.root.right, False) return ret -- cgit v1.3