Commit 53f9506

hanif-aliOmkarPathak

authored and

committed

Added Pretty Printing feature to Binary Tree Programs (#17)

* Added some more functions to BinarySearchTree. -> Defining intial elements of newly created Trees -> Prettyprinting trees with left-right order and * representing null nodes. * Added pretty print to BinaryTree.py * Fixed flake8 Linting

1 parent 1cf984a commit 53f9506Copy full SHA for 53f9506

File tree

2 files changed

+43

-1

lines changed

Programs
- P43_BinarySearchTree.py
- P62_BinaryTree.py

2 files changed

+43

-1

lines changed

`‎Programs/P43_BinarySearchTree.py`

Lines changed: 22 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -72,9 +72,13 @@ def postorder(self):`
`72`	`72`	`print(str(self.data), end = ' ')`
`73`	`73`
`74`	`74`	`class Tree(object):`
`75`		`- def __init__(self):`
	`75`	`+ def __init__(self, initial_data= []):`
`76`	`76`	`self.root = None`
`77`	`77`
	`78`	`+ # If provided, add initial data`
	`79`	`+ for data in initial_data:`
	`80`	`+ self.insert(data)`
	`81`	`+`
`78`	`82`	`def insert(self, data):`
`79`	`83`	`if self.root:`
`80`	`84`	`return self.root.insert(data)`
`@@ -106,6 +110,22 @@ def postorder(self):`
`106`	`110`	`print('Postorder: ')`
`107`	`111`	`self.root.postorder()`
`108`	`112`
	`113`	`+`
	`114`	`+ def pprint(self, head_node=0, _pre="", _last=True, term=False):`
	`115`	`+`
	`116`	`+ head_node = self.root if head_node == 0 else head_node`
	`117`	`+`
	`118`	`+ data = "*" if head_node is None else head_node.data`
	`119`	`+`
	`120`	+ print(_pre, "`- " if _last else "\|- ", data, sep="")
	`121`	`+ _pre += " " if _last else "\| "`
	`122`	`+`
	`123`	`+ if term: return`
	`124`	`+`
	`125`	`+ for i, child in enumerate([head_node.leftChild, head_node.rightChild]):`
	`126`	`+ self.pprint(child, _pre, bool(i) ,term=not(bool(child)))`
	`127`	`+`
	`128`	`+`
`109`	`129`	`if __name__ == '__main__':`
`110`	`130`	`tree = Tree()`
`111`	`131`	`tree.insert(10)`
`@@ -117,6 +137,7 @@ def postorder(self):`
`117`	`137`	`tree.insert(7)`
`118`	`138`	`tree.insert(15)`
`119`	`139`	`tree.insert(13)`
	`140`	`+ tree.pprint()`
`120`	`141`	`print(tree.find(1))`
`121`	`142`	`print(tree.find(12))`
`122`	`143`	`tree.preorder()`

`‎Programs/P62_BinaryTree.py`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,18 +38,39 @@ def insertLeft(self,newnodeData):`
`38`	`38`	`tree.left = self.left`
`39`	`39`
`40`	`40`
	`41`	`+`
	`42`	`+`
`41`	`43`	`def printTree(tree):`
`42`	`44`	`if tree != None:`
`43`	`45`	`printTree(tree.getLeftChild())`
`44`	`46`	`print(tree.getnodeDataValue())`
`45`	`47`	`printTree(tree.getRightChild())`
`46`	`48`
	`49`	`+`
	`50`	`+def pprint(head_node, _pre="", _last=True, term=False):`
	`51`	`+ data = "*" if head_node is None else head_node.nodeData`
	`52`	`+`
	`53`	+ print(_pre, "`- " if _last else "\|- ", data, sep="")
	`54`	`+ _pre += " " if _last else "\| "`
	`55`	`+`
	`56`	`+ if term: return`
	`57`	`+`
	`58`	`+ left = head_node.getLeftChild()`
	`59`	`+ right = head_node.getRightChild()`
	`60`	`+`
	`61`	`+ for i, child in enumerate([left, right]):`
	`62`	`+ pprint(child, _pre, bool(i) ,term=not(bool(child)))`
	`63`	`+`
	`64`	`+`
	`65`	`+`
	`66`	`+`
`47`	`67`	`def testTree():`
`48`	`68`	`myTree = BinaryTree("1")`
`49`	`69`	`myTree.insertLeft("2")`
`50`	`70`	`myTree.insertRight("3")`
`51`	`71`	`myTree.insertRight("4")`
`52`	`72`	`printTree(myTree)`
	`73`	`+ pprint(myTree)`
`53`	`74`
`54`	`75`	`if __name__ == '__main__':`
`55`	`76`	`testTree()`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 53f9506

File tree

2 files changed

2 files changed

`‎Programs/P43_BinarySearchTree.py`

`‎Programs/P62_BinaryTree.py`

0 commit comments