GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithm/tree/binaryTree.py at python · itsvinayak/algorithm Expand file tree/ Copy pathbinaryTree.pyMore file actions 78 lines (62 loc) · 1.71 KB / Copy pathbinaryTree.pyFile metadata and controls78 lines (62 loc) · 1.71 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 class Node: """ single Node for tree """ def __init__(self, data): self.data = data self.right = None self.left = None class binaryTree: """ binary tree implementation """ def __init__(self): self.root = None def push(self, element, node=None): if node is None: node = self.root if self.root is None: self.root = Node(element) else: if element < node.data: if node.left is not None: self.push(element, node.left) else: node.left = Node(element) else: if node.right is not None: self.push(element, node.right) else: node.right = Node(element) def __str__(self): return self.printInorder(self.root) def printPreorder(self, node, traversal=""): pass def printPostorder(self, node, traversal=""): pass def printLevelOrder(self, node): pass def printInorder(self, node, traversal=""): """ print tree in inorder """ if node is not None: traversal = self.printInorder(node.left, traversal) traversal += str(node.data) + " - " traversal = self.printInorder(node.right, traversal) return traversal def main(): """ Main code and logic comes here """ tree = binaryTree() tree.push(5) tree.push(3) tree.push(1) tree.push(3) tree.push(0) tree.push(2) tree.push(9) print(tree) if __name__ == "__main__": main() |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |