├── .github ├── CODEOWNERS ├── ISSUE_TEMPLATE.md ├── PULL_REQUEST_TEMPLATE.md └── workflows │ └── main.yml ├── .gitignore ├── 01_01 └── tree.py ├── 01_02_b └── tree.py ├── 01_02_e └── tree.py ├── 01_03_b └── tree.py ├── 01_03_e └── tree.py ├── 01_04_b └── tree.py ├── 01_04_e └── tree.py ├── 01_05_b └── tree.py ├── 01_05_e └── tree.py ├── 01_07 └── tree.py ├── 02_01_b └── tree.py ├── 02_01_e └── tree.py ├── 02_03_b └── tree.py ├── 02_03_e └── tree.py ├── 02_04_b └── tree.py ├── 02_04_e └── tree.py ├── 02_06 └── tree.py ├── 03_02_b └── tree.py ├── 03_02_e └── tree.py ├── 03_03_b └── tree.py ├── 03_03_e └── tree.py ├── 03_05 └── tree.py ├── CONTRIBUTING.md ├── LICENSE ├── NOTICE └── README.md /.github/CODEOWNERS: -------------------------------------------------------------------------------- 1 | # Codeowners for these exercise files: 2 | # * (asterisk) deotes "all files and folders" 3 | # Example: * @producer @instructor 4 | -------------------------------------------------------------------------------- /.github/ISSUE_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 7 | 8 | ## Issue Overview 9 | 10 | 11 | ## Describe your environment 12 | 13 | 14 | ## Steps to Reproduce 15 | 16 | 1. 17 | 2. 18 | 3. 19 | 4. 20 | 21 | ## Expected Behavior 22 | 23 | 24 | ## Current Behavior 25 | 26 | 27 | ## Possible Solution 28 | 29 | 30 | ## Screenshots / Video 31 | 32 | 33 | ## Related Issues 34 | 35 | -------------------------------------------------------------------------------- /.github/PULL_REQUEST_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /.github/workflows/main.yml: -------------------------------------------------------------------------------- 1 | name: Copy To Branches 2 | on: 3 | workflow_dispatch: 4 | jobs: 5 | copy-to-branches: 6 | runs-on: ubuntu-latest 7 | steps: 8 | - uses: actions/checkout@v2 9 | with: 10 | fetch-depth: 0 11 | - name: Copy To Branches Action 12 | uses: planetoftheweb/copy-to-branches@v1 13 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | node_modules 3 | .tmp 4 | npm-debug.log 5 | -------------------------------------------------------------------------------- /01_01/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | class Tree: 8 | def __init__(self, root, name=''): 9 | self.root = root 10 | self.name = name 11 | 12 | 13 | node = Node(10) 14 | 15 | node.left = Node(5) 16 | node.right = Node(15) 17 | 18 | node.left.left = Node(2) 19 | node.left.right = Node(6) 20 | 21 | node.right.left = Node(13) 22 | node.right.right = Node(10000) 23 | 24 | 25 | 26 | myTree = Tree(node, 'Ryan\'s Tree') 27 | 28 | print(myTree.name) 29 | print(myTree.root.left.data) 30 | 31 | print(myTree.root.right.right.data) 32 | -------------------------------------------------------------------------------- /01_02_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | class Tree: 8 | def __init__(self, root, name=''): 9 | self.root = root 10 | self.name = name 11 | 12 | 13 | node = Node(10) 14 | 15 | node.left = Node(5) 16 | node.right = Node(15) 17 | 18 | node.left.left = Node(2) 19 | node.left.right = Node(6) 20 | 21 | node.right.left = Node(13) 22 | node.right.right = Node(10000) 23 | 24 | myTree = Tree(node, 'Ryan\'s Tree') 25 | -------------------------------------------------------------------------------- /01_02_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | 21 | class Tree: 22 | def __init__(self, root, name=''): 23 | self.root = root 24 | self.name = name 25 | 26 | def search(self, target): 27 | return self.root.search(target) 28 | 29 | node = Node(10) 30 | 31 | node.left = Node(5) 32 | node.right = Node(15) 33 | 34 | node.left.left = Node(2) 35 | node.left.right = Node(6) 36 | 37 | node.right.left = Node(13) 38 | node.right.right = Node(10000) 39 | 40 | myTree = Tree(node, 'Ryan\'s Tree') 41 | 42 | found = myTree.search(10000) 43 | print(found.data) 44 | -------------------------------------------------------------------------------- /01_03_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | 21 | class Tree: 22 | def __init__(self, root, name=''): 23 | self.root = root 24 | self.name = name 25 | 26 | def search(self, target): 27 | return self.root.search(target) 28 | 29 | tree = Tree(Node(50), 'Tree Traversals') 30 | tree.root.left = Node(25) 31 | tree.root.right = Node(75) 32 | tree.root.left.left = Node(10) 33 | tree.root.left.right = Node(35) 34 | tree.root.left.right.left = Node(30) 35 | tree.root.left.right.right = Node(42) 36 | tree.root.left.left.left = Node(5) 37 | tree.root.left.left.right = Node(13) 38 | -------------------------------------------------------------------------------- /01_03_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | def traversePreorder(self): 21 | print(self.data) 22 | if self.left: 23 | self.left.traversePreorder() 24 | if self.right: 25 | self.right.traversePreorder() 26 | 27 | def traverseInorder(self): 28 | if self.left: 29 | self.left.traverseInorder() 30 | print(self.data) 31 | if self.right: 32 | self.right.traverseInorder() 33 | 34 | def traversePostorder(self): 35 | if self.left: 36 | self.left.traversePostorder() 37 | if self.right: 38 | self.right.traversePostorder() 39 | print(self.data) 40 | 41 | class Tree: 42 | def __init__(self, root, name=''): 43 | self.root = root 44 | self.name = name 45 | 46 | def search(self, target): 47 | return self.root.search(target) 48 | 49 | tree = Tree(Node(50), 'Tree Traversals') 50 | tree.root.left = Node(25) 51 | tree.root.right = Node(75) 52 | tree.root.left.left = Node(10) 53 | tree.root.left.right = Node(35) 54 | tree.root.left.right.left = Node(30) 55 | tree.root.left.right.right = Node(42) 56 | tree.root.left.left.left = Node(5) 57 | tree.root.left.left.right = Node(13) 58 | -------------------------------------------------------------------------------- /01_04_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | 21 | class Tree: 22 | def __init__(self, root, name=''): 23 | self.root = root 24 | self.name = name 25 | 26 | def search(self, target): 27 | return self.root.search(target) 28 | 29 | 30 | tree = Tree(Node(50), 'A Very Tall Tree') 31 | tree.root.left = Node(25) 32 | tree.root.right = Node(75) 33 | tree.root.left.left = Node(10) 34 | tree.root.left.right = Node(35) 35 | tree.root.left.right.left = Node(30) 36 | tree.root.left.right.right = Node(42) 37 | tree.root.left.left.left = Node(5) 38 | tree.root.left.left.right = Node(13) 39 | tree.root.left.left.left.left = Node(2) 40 | -------------------------------------------------------------------------------- /01_04_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | def height(self, h=0): 21 | leftHeight = self.left.height(h+1) if self.left else h 22 | rightHeight = self.right.height(h+1) if self.right else h 23 | return max(leftHeight, rightHeight) 24 | 25 | class Tree: 26 | def __init__(self, root, name=''): 27 | self.root = root 28 | self.name = name 29 | 30 | def search(self, target): 31 | return self.root.search(target) 32 | 33 | def height(self): 34 | return self.root.height() 35 | 36 | tree = Tree(Node(50), 'A Very Tall Tree') 37 | tree.root.left = Node(25) 38 | tree.root.right = Node(75) 39 | tree.root.left.left = Node(10) 40 | tree.root.left.right = Node(35) 41 | tree.root.left.right.left = Node(30) 42 | tree.root.left.right.right = Node(42) 43 | tree.root.left.left.left = Node(5) 44 | tree.root.left.left.right = Node(13) 45 | tree.root.left.left.left.left = Node(2) 46 | 47 | print(tree.height()) 48 | 49 | tree = Tree(Node(50), 'A Very Short Tree') 50 | print(tree.height()) 51 | -------------------------------------------------------------------------------- /01_05_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | 18 | print("Value is not in tree") 19 | 20 | def height(self, h=0): 21 | leftHeight = self.left.height(h+1) if self.left else h 22 | rightHeight = self.right.height(h+1) if self.right else h 23 | return max(leftHeight, rightHeight) 24 | 25 | class Tree: 26 | def __init__(self, root, name=''): 27 | self.root = root 28 | self.name = name 29 | 30 | def search(self, target): 31 | return self.root.search(target) 32 | 33 | def height(self): 34 | return self.root.height() 35 | 36 | tree = Tree(Node(50), 'A Very Tall Tree') 37 | tree.root.left = Node(25) 38 | tree.root.right = Node(75) 39 | tree.root.left.left = Node(10) 40 | tree.root.left.right = Node(35) 41 | tree.root.left.right.left = Node(30) 42 | tree.root.left.right.right = Node(42) 43 | tree.root.left.left.left = Node(5) 44 | tree.root.left.left.right = Node(13) 45 | tree.root.left.left.left.left = Node(2) 46 | 47 | print(tree.height()) 48 | 49 | tree = Tree(Node(50), 'A Very Short Tree') 50 | print(tree.height()) 51 | -------------------------------------------------------------------------------- /01_05_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | 64 | class Tree: 65 | def __init__(self, root, name=''): 66 | self.root = root 67 | self.name = name 68 | 69 | def traverseInorder(self): 70 | self.root.traverseInorder() 71 | 72 | def traversePreorder(self): 73 | self.root.traversePreorder() 74 | 75 | def traversePostorder(self): 76 | self.root.traversePostorder() 77 | 78 | def search(self, target): 79 | return self.root.search(target) 80 | 81 | def getNodesAtDepth(self, depth): 82 | return self.root.getNodesAtDepth(depth) 83 | 84 | def height(self): 85 | return self.root.height() 86 | 87 | 88 | tree = Tree(Node(50)) 89 | tree.root.left = Node(25) 90 | tree.root.right = Node(75) 91 | tree.root.left.left = Node(13) 92 | tree.root.left.right = Node(35) 93 | tree.root.left.right.right = Node(37) 94 | tree.root.right.left = Node(55) 95 | tree.root.right.right = Node(103) 96 | tree.root.left.left.left = Node(2) 97 | tree.root.left.left.right = Node(20) 98 | tree.root.right.left = Node(55) 99 | tree.root.right.right.right = Node(256) 100 | 101 | print(tree.getNodesAtDepth(3)) 102 | -------------------------------------------------------------------------------- /01_07/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | 64 | class Tree: 65 | def __init__(self, root, name=''): 66 | self.root = root 67 | self.name = name 68 | 69 | def _nodeToChar(self, n, spacing): 70 | if n is None: 71 | return '_'+(' '*spacing) 72 | spacing = spacing-len(str(n))+1 73 | return str(n)+(' '*spacing) 74 | 75 | def print(self, label=''): 76 | print(self.name+' '+label) 77 | height = self.root.height() 78 | spacing = 3 79 | width = int((2**height-1) * (spacing+1) + 1) 80 | # Root offset 81 | offset = int((width-1)/2) 82 | for depth in range(0, height+1): 83 | if depth > 0: 84 | # print directional lines 85 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 86 | row = self.root.getNodesAtDepth(depth, []) 87 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 88 | spacing = offset+1 89 | offset = int(offset/2) - 1 90 | print('') 91 | 92 | def traverseInorder(self): 93 | self.root.traverseInorder() 94 | 95 | def traversePreorder(self): 96 | self.root.traversePreorder() 97 | 98 | def traversePostorder(self): 99 | self.root.traversePostorder() 100 | 101 | def search(self, target): 102 | return self.root.search(target) 103 | 104 | def getNodesAtDepth(self, depth): 105 | return self.root.getNodesAtDepth(depth) 106 | 107 | def height(self): 108 | return self.root.height() 109 | 110 | 111 | tree = Tree(Node(50)) 112 | tree.root.left = Node(25) 113 | tree.root.right = Node(75) 114 | tree.root.left.left = Node(13) 115 | tree.root.left.right = Node(35) 116 | tree.root.left.right.right = Node(37) 117 | tree.root.right.left = Node(55) 118 | tree.root.right.right = Node(103) 119 | tree.root.left.left.left = Node(2) 120 | tree.root.left.left.right = Node(20) 121 | tree.root.right.left = Node(55) 122 | tree.root.right.right.right = Node(256) 123 | 124 | tree.print() 125 | -------------------------------------------------------------------------------- /02_01_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | 64 | class Tree: 65 | def __init__(self, root, name=''): 66 | self.root = root 67 | self.name = name 68 | 69 | def _nodeToChar(self, n, spacing): 70 | if n is None: 71 | return '_'+(' '*spacing) 72 | spacing = spacing-len(str(n))+1 73 | return str(n)+(' '*spacing) 74 | 75 | def print(self, label=''): 76 | print(self.name+' '+label) 77 | height = self.root.height() 78 | spacing = 3 79 | width = int((2**height-1) * (spacing+1) + 1) 80 | # Root offset 81 | offset = int((width-1)/2) 82 | for depth in range(0, height+1): 83 | if depth > 0: 84 | # print directional lines 85 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 86 | row = self.root.getNodesAtDepth(depth, []) 87 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 88 | spacing = offset+1 89 | offset = int(offset/2) - 1 90 | print('') 91 | 92 | def traverseInorder(self): 93 | self.root.traverseInorder() 94 | 95 | def traversePreorder(self): 96 | self.root.traversePreorder() 97 | 98 | def traversePostorder(self): 99 | self.root.traversePostorder() 100 | 101 | def search(self, target): 102 | return self.root.search(target) 103 | 104 | def getNodesAtDepth(self, depth): 105 | return self.root.getNodesAtDepth(depth) 106 | 107 | def height(self): 108 | return self.root.height() 109 | 110 | 111 | tree = Tree(Node(50)) 112 | tree.root.left = Node(25) 113 | tree.root.right = Node(75) 114 | 115 | tree.print() 116 | -------------------------------------------------------------------------------- /02_01_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | def add(self, data): 64 | if data == self.data: 65 | # Binary search trees do not contain duplicates 66 | return 67 | if data < self.data: 68 | if self.left is None: 69 | self.left = Node(data) 70 | return 71 | else: 72 | self.left.add(data) 73 | 74 | if data > self.data: 75 | if self.right is None: 76 | self.right = Node(data) 77 | return 78 | else: 79 | self.right.add(data) 80 | 81 | class Tree: 82 | def __init__(self, root, name=''): 83 | self.root = root 84 | self.name = name 85 | 86 | def _nodeToChar(self, n, spacing): 87 | if n is None: 88 | return '_'+(' '*spacing) 89 | spacing = spacing-len(str(n))+1 90 | return str(n)+(' '*spacing) 91 | 92 | def print(self, label=''): 93 | print(self.name+' '+label) 94 | height = self.root.height() 95 | spacing = 3 96 | width = int((2**height-1) * (spacing+1) + 1) 97 | # Root offset 98 | offset = int((width-1)/2) 99 | for depth in range(0, height+1): 100 | if depth > 0: 101 | # print directional lines 102 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 103 | row = self.root.getNodesAtDepth(depth, []) 104 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 105 | spacing = offset+1 106 | offset = int(offset/2) - 1 107 | print('') 108 | 109 | def traverseInorder(self): 110 | self.root.traverseInorder() 111 | 112 | def traversePreorder(self): 113 | self.root.traversePreorder() 114 | 115 | def traversePostorder(self): 116 | self.root.traversePostorder() 117 | 118 | def search(self, target): 119 | return self.root.search(target) 120 | 121 | def getNodesAtDepth(self, depth): 122 | return self.root.getNodesAtDepth(depth) 123 | 124 | def height(self): 125 | return self.root.height() 126 | 127 | def add(self, data): 128 | self.root.add(data) 129 | 130 | 131 | tree = Tree(Node(50)) 132 | tree.root.left = Node(25) 133 | tree.root.right = Node(75) 134 | tree.add(10) 135 | tree.add(76) 136 | tree.print() 137 | -------------------------------------------------------------------------------- /02_03_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | def add(self, data): 64 | if data == self.data: 65 | # Binary search tree does not contain duplicates 66 | return 67 | if data < self.data: 68 | if self.left is None: 69 | self.left = Node(data) 70 | return 71 | else: 72 | self.left.add(data) 73 | 74 | if data > self.data: 75 | if self.right is None: 76 | self.right = Node(data) 77 | return 78 | else: 79 | self.right.add(data) 80 | 81 | class Tree: 82 | def __init__(self, root, name=''): 83 | self.root = root 84 | self.name = name 85 | 86 | def _nodeToChar(self, n, spacing): 87 | if n is None: 88 | return '_'+(' '*spacing) 89 | spacing = spacing-len(str(n))+1 90 | return str(n)+(' '*spacing) 91 | 92 | def print(self, label=''): 93 | print(self.name+' '+label) 94 | height = self.root.height() 95 | spacing = 3 96 | width = int((2**height-1) * (spacing+1) + 1) 97 | # Root offset 98 | offset = int((width-1)/2) 99 | for depth in range(0, height+1): 100 | if depth > 0: 101 | # print directional lines 102 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 103 | row = self.root.getNodesAtDepth(depth, []) 104 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 105 | spacing = offset+1 106 | offset = int(offset/2) - 1 107 | print('') 108 | 109 | def traverseInorder(self): 110 | self.root.traverseInorder() 111 | 112 | def traversePreorder(self): 113 | self.root.traversePreorder() 114 | 115 | def traversePostorder(self): 116 | self.root.traversePostorder() 117 | 118 | def search(self, target): 119 | return self.root.search(target) 120 | 121 | def getNodesAtDepth(self, depth): 122 | return self.root.getNodesAtDepth(depth) 123 | 124 | def height(self): 125 | return self.root.height() 126 | 127 | def add(self, data): 128 | self.root.add(data) 129 | 130 | 131 | tree = Tree(Node(50)) 132 | tree.root.left = Node(25) 133 | tree.root.right = Node(75) 134 | tree.root.right.left = Node(67) 135 | tree.root.right.right = Node(100) 136 | tree.root.right.right.right = Node(120) 137 | tree.root.right.right.left = Node(80) 138 | tree.root.right.right.left.right = Node(92) 139 | 140 | tree.print() 141 | -------------------------------------------------------------------------------- /02_03_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | def add(self, data): 64 | if data == self.data: 65 | # Binary search tree does not contain duplicates 66 | return 67 | if data < self.data: 68 | if self.left is None: 69 | self.left = Node(data) 70 | return 71 | else: 72 | self.left.add(data) 73 | 74 | if data > self.data: 75 | if self.right is None: 76 | self.right = Node(data) 77 | return 78 | else: 79 | self.right.add(data) 80 | 81 | def findMin(self): 82 | if self.left: 83 | return self.left.findMin() 84 | return self 85 | 86 | def delete(self, target): 87 | if self.data == target: 88 | if self.right and self.left: 89 | minimumValue = self.right.findMin() 90 | self.data = minimumValue.data 91 | self.right = self.right.delete(minimumValue.data) 92 | return self 93 | else: 94 | return self.right or self.left 95 | 96 | if self.right and target > self.data: 97 | self.right = self.right.delete(target) 98 | 99 | if self.left and target < self.data: 100 | self.left = self.left.delete(target) 101 | return self 102 | 103 | class Tree: 104 | def __init__(self, root, name=''): 105 | self.root = root 106 | self.name = name 107 | 108 | def _nodeToChar(self, n, spacing): 109 | if n is None: 110 | return '_'+(' '*spacing) 111 | spacing = spacing-len(str(n))+1 112 | return str(n)+(' '*spacing) 113 | 114 | def print(self, label=''): 115 | print(self.name+' '+label) 116 | height = self.root.height() 117 | spacing = 3 118 | width = int((2**height-1) * (spacing+1) + 1) 119 | # Root offset 120 | offset = int((width-1)/2) 121 | for depth in range(0, height+1): 122 | if depth > 0: 123 | # print directional lines 124 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 125 | row = self.root.getNodesAtDepth(depth, []) 126 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 127 | spacing = offset+1 128 | offset = int(offset/2) - 1 129 | print('') 130 | 131 | def traverseInorder(self): 132 | self.root.traverseInorder() 133 | 134 | def traversePreorder(self): 135 | self.root.traversePreorder() 136 | 137 | def traversePostorder(self): 138 | self.root.traversePostorder() 139 | 140 | def search(self, target): 141 | return self.root.search(target) 142 | 143 | def getNodesAtDepth(self, depth): 144 | return self.root.getNodesAtDepth(depth) 145 | 146 | def height(self): 147 | return self.root.height() 148 | 149 | def add(self): 150 | self.root.add() 151 | 152 | def delete(self, target): 153 | self.root = self.root.delete(target) 154 | 155 | 156 | tree = Tree(Node(50)) 157 | tree.root.left = Node(25) 158 | tree.root.right = Node(75) 159 | tree.root.right.left = Node(67) 160 | tree.root.right.right = Node(100) 161 | tree.root.right.right.right = Node(120) 162 | tree.root.right.right.left = Node(80) 163 | tree.root.right.right.left.right = Node(92) 164 | 165 | tree.print() 166 | 167 | tree.delete(75) 168 | tree.delete(50) 169 | tree.print() -------------------------------------------------------------------------------- /02_04_b/tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/LinkedInLearning/python-data-structures-trees-2834010/1f52aa62560b7bf1daf682b5c06fbb5f41ab31e5/02_04_b/tree.py -------------------------------------------------------------------------------- /02_04_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def traversePreorder(self): 8 | print(self.data) 9 | if self.left: 10 | self.left.traversePreorder() 11 | if self.right: 12 | self.right.traversePreorder() 13 | 14 | def traverseInorder(self): 15 | if self.left: 16 | self.left.traverseInorder() 17 | print(self.data) 18 | if self.right: 19 | self.right.traverseInorder() 20 | 21 | def traversePostorder(self): 22 | if self.left: 23 | self.left.traversePostorder() 24 | if self.right: 25 | self.right.traversePostorder() 26 | print(self.data) 27 | 28 | def search(self, target): 29 | if self.data == target: 30 | print("Found it!") 31 | return self 32 | 33 | if self.left and self.data > target: 34 | return self.left.search(target) 35 | 36 | if self.right and self.data < target: 37 | return self.right.search(target) 38 | 39 | print("Value is not in tree") 40 | 41 | 42 | def getNodesAtDepth(self, depth, nodes=[]): 43 | if depth == 0: 44 | nodes.append(self.data) 45 | return nodes 46 | 47 | if self.left: 48 | self.left.getNodesAtDepth(depth-1, nodes) 49 | else: 50 | nodes.extend([None]*2**(depth-1)) 51 | 52 | if self.right: 53 | self.right.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | return nodes 57 | 58 | def height(self, h=0): 59 | leftHeight = self.left.height(h+1) if self.left else h 60 | rightHeight = self.right.height(h+1) if self.right else h 61 | return max(leftHeight, rightHeight) 62 | 63 | def add(self, data): 64 | if data == self.data: 65 | # Binary search tree does not contain duplicates 66 | return 67 | if data < self.data: 68 | if self.left is None: 69 | self.left = Node(data) 70 | return 71 | else: 72 | self.left.add(data) 73 | 74 | if data > self.data: 75 | if self.right is None: 76 | self.right = Node(data) 77 | return 78 | else: 79 | self.right.add(data) 80 | 81 | def findMin(self): 82 | if self.left: 83 | return self.left.findMin() 84 | return self 85 | 86 | def delete(self, target): 87 | if self.data == target: 88 | if self.right and self.left: 89 | minimumValue = self.right.findMin() 90 | self.data = minimumValue.data 91 | self.right = self.right.delete(minimumValue.data) 92 | return self 93 | else: 94 | return self.right or self.left 95 | 96 | if self.right and target > self.data: 97 | self.right = self.right.delete(target) 98 | 99 | if self.left and target < self.data: 100 | self.left = self.left.delete(target) 101 | return self 102 | 103 | def isBalanced(self): 104 | leftHeight = self.left.height()+1 if self.left else 0 105 | rightHeight = self.right.height()+1 if self.right else 0 106 | return abs(leftHeight - rightHeight) < 2 107 | 108 | class Tree: 109 | def __init__(self, root, name=''): 110 | self.root = root 111 | self.name = name 112 | 113 | def _nodeToChar(self, n, spacing): 114 | if n is None: 115 | return '_'+(' '*spacing) 116 | spacing = spacing-len(str(n))+1 117 | return str(n)+(' '*spacing) 118 | 119 | def print(self, label=''): 120 | print(self.name+' '+label) 121 | height = self.root.height() 122 | spacing = 3 123 | width = int((2**height-1) * (spacing+1) + 1) 124 | # Root offset 125 | offset = int((width-1)/2) 126 | for depth in range(0, height+1): 127 | if depth > 0: 128 | # print directional lines 129 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 130 | row = self.root.getNodesAtDepth(depth, []) 131 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 132 | spacing = offset+1 133 | offset = int(offset/2) - 1 134 | print('') 135 | 136 | def traverseInorder(self): 137 | self.root.traverseInorder() 138 | 139 | def traversePreorder(self): 140 | self.root.traversePreorder() 141 | 142 | def traversePostorder(self): 143 | self.root.traversePostorder() 144 | 145 | def search(self, target): 146 | return self.root.search(target) 147 | 148 | def getNodesAtDepth(self, depth): 149 | return self.root.getNodesAtDepth(depth) 150 | 151 | def height(self): 152 | return self.root.height() 153 | 154 | def add(self): 155 | self.root.add() 156 | 157 | def delete(self, target): 158 | self.root = self.root.delete(target) 159 | 160 | 161 | tree = Tree(Node(50)) 162 | tree.root.left = Node(25) 163 | tree.root.right = Node(75) 164 | tree.root.right.right = Node(100) 165 | tree.root.right.right.right = Node(150) 166 | 167 | tree.print() 168 | 169 | print(tree.root.isBalanced()) 170 | print(tree.root.left.isBalanced()) 171 | -------------------------------------------------------------------------------- /02_06/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def toStr(self): 8 | if not self.isBalanced(): 9 | return str(self.data)+'*' 10 | return str(self.data) 11 | 12 | def traversePreorder(self): 13 | print(self.data) 14 | if self.left: 15 | self.left.traversePreorder() 16 | if self.right: 17 | self.right.traversePreorder() 18 | 19 | def traverseInorder(self): 20 | if self.left: 21 | self.left.traverseInorder() 22 | print(self.data) 23 | if self.right: 24 | self.right.traverseInorder() 25 | 26 | def traversePostorder(self): 27 | if self.left: 28 | self.left.traversePostorder() 29 | if self.right: 30 | self.right.traversePostorder() 31 | print(self.data) 32 | 33 | def search(self, target): 34 | if self.data == target: 35 | print("Found it!") 36 | return self 37 | 38 | if self.left and self.data > target: 39 | return self.left.search(target) 40 | 41 | if self.right and self.data < target: 42 | return self.right.search(target) 43 | 44 | print("Value is not in tree") 45 | 46 | 47 | def getNodesAtDepth(self, depth, nodes=[]): 48 | if depth == 0: 49 | nodes.append(self.data) 50 | return nodes 51 | 52 | if self.left: 53 | self.left.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | 57 | if self.right: 58 | self.right.getNodesAtDepth(depth-1, nodes) 59 | else: 60 | nodes.extend([None]*2**(depth-1)) 61 | return nodes 62 | 63 | def height(self, h=0): 64 | leftHeight = self.left.height(h+1) if self.left else h 65 | rightHeight = self.right.height(h+1) if self.right else h 66 | return max(leftHeight, rightHeight) 67 | 68 | def add(self, data): 69 | if data == self.data: 70 | # Binary search tree does not contain duplicates 71 | return 72 | if data < self.data: 73 | if self.left is None: 74 | self.left = Node(data) 75 | return 76 | else: 77 | self.left.add(data) 78 | 79 | if data > self.data: 80 | if self.right is None: 81 | self.right = Node(data) 82 | return 83 | else: 84 | self.right.add(data) 85 | 86 | def findMin(self): 87 | if self.left: 88 | return self.left.findMin() 89 | return self 90 | 91 | def delete(self, target): 92 | if self.data == target: 93 | if self.right and self.left: 94 | minimumValue = self.right.findMin() 95 | self.data = minimumValue.data 96 | self.right = self.right.delete(minimumValue.data) 97 | return self 98 | else: 99 | return self.right or self.left 100 | 101 | if self.right and target > self.data: 102 | self.right = self.right.delete(target) 103 | 104 | if self.left and target < self.data: 105 | self.left = self.left.delete(target) 106 | return self 107 | 108 | class Tree: 109 | def __init__(self, root, name=''): 110 | self.root = root 111 | self.name = name 112 | 113 | def _nodeToChar(self, n, spacing): 114 | if n is None: 115 | return '_'+(' '*spacing) 116 | spacing = spacing-len(n.toStr())+1 117 | return n.toStr()+(' '*spacing) 118 | 119 | def print(self, label=''): 120 | print(self.name+' '+label) 121 | height = self.root.height() 122 | spacing = 3 123 | width = int((2**height-1) * (spacing+1) + 1) 124 | # Root offset 125 | offset = int((width-1)/2) 126 | for depth in range(0, height+1): 127 | if depth > 0: 128 | # print directional lines 129 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 130 | row = self.root.getNodesAtDepth(depth, []) 131 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 132 | spacing = offset+1 133 | offset = int(offset/2) - 1 134 | print('') 135 | 136 | def traverseInorder(self): 137 | self.root.traverseInorder() 138 | 139 | def traversePreorder(self): 140 | self.root.traversePreorder() 141 | 142 | def traversePostorder(self): 143 | self.root.traversePostorder() 144 | 145 | def search(self, target): 146 | return self.root.search(target) 147 | 148 | def getNodesAtDepth(self, depth): 149 | return self.root.getNodesAtDepth(depth) 150 | 151 | def height(self): 152 | return self.root.height() 153 | 154 | def add(self): 155 | self.root.add() 156 | 157 | def delete(self, target): 158 | self.root = self.root.delete(target) 159 | 160 | 161 | tree = Tree(Node(50)) 162 | tree.root.left = Node(25) 163 | tree.root.right = Node(75) 164 | tree.root.right.right = Node(100) 165 | tree.root.right.right.right = Node(150) 166 | 167 | tree.print() 168 | -------------------------------------------------------------------------------- /03_02_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def toStr(self): 8 | if not self.isBalanced(): 9 | return str(self.data)+'*' 10 | return str(self.data) 11 | 12 | def traversePreorder(self): 13 | print(self.data) 14 | if self.left: 15 | self.left.traversePreorder() 16 | if self.right: 17 | self.right.traversePreorder() 18 | 19 | def traverseInorder(self): 20 | if self.left: 21 | self.left.traverseInorder() 22 | print(self.data) 23 | if self.right: 24 | self.right.traverseInorder() 25 | 26 | def traversePostorder(self): 27 | if self.left: 28 | self.left.traversePostorder() 29 | if self.right: 30 | self.right.traversePostorder() 31 | print(self.data) 32 | 33 | def search(self, target): 34 | if self.data == target: 35 | print("Found it!") 36 | return self 37 | 38 | if self.left and self.data > target: 39 | return self.left.search(target) 40 | 41 | if self.right and self.data < target: 42 | return self.right.search(target) 43 | 44 | print("Value is not in tree") 45 | 46 | 47 | def getNodesAtDepth(self, depth, nodes): 48 | if depth == 0: 49 | nodes.append(self) 50 | return nodes 51 | 52 | if self.left: 53 | self.left.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | 57 | if self.right: 58 | self.right.getNodesAtDepth(depth-1, nodes) 59 | else: 60 | nodes.extend([None]*2**(depth-1)) 61 | return nodes 62 | 63 | def height(self, h=0): 64 | leftHeight = self.left.height(h+1) if self.left else h 65 | rightHeight = self.right.height(h+1) if self.right else h 66 | return max(leftHeight, rightHeight) 67 | 68 | def add(self, data): 69 | if data == self.data: 70 | # Binary search tree does not contain duplicates 71 | return 72 | if data < self.data: 73 | if self.left is None: 74 | self.left = Node(data) 75 | return 76 | else: 77 | self.left.add(data) 78 | 79 | if data > self.data: 80 | if self.right is None: 81 | self.right = Node(data) 82 | return 83 | else: 84 | self.right.add(data) 85 | 86 | def findMin(self): 87 | if self.left: 88 | return self.left.findMin() 89 | return self 90 | 91 | def delete(self, target): 92 | if self.data == target: 93 | if self.right and self.left: 94 | minimumValue = self.right.findMin() 95 | self.data = minimumValue.data 96 | self.right = self.right.delete(minimumValue.data) 97 | return self 98 | else: 99 | return self.right or self.left 100 | 101 | if self.right and target > self.data: 102 | self.right = self.right.delete(target) 103 | 104 | if self.left and target < self.data: 105 | self.left = self.left.delete(target) 106 | return self 107 | 108 | def isBalanced(self): 109 | leftHeight = self.left.height()+1 if self.left else 0 110 | rightHeight = self.right.height()+1 if self.right else 0 111 | return abs(leftHeight - rightHeight) < 2 112 | 113 | class Tree: 114 | def __init__(self, root, name=''): 115 | self.root = root 116 | self.name = name 117 | 118 | def _nodeToChar(self, n, spacing): 119 | if n is None: 120 | return '_'+(' '*spacing) 121 | spacing = spacing-len(n.toStr())+1 122 | return n.toStr()+(' '*spacing) 123 | 124 | def print(self, label=''): 125 | print(self.name+' '+label) 126 | height = self.root.height() 127 | spacing = 3 128 | width = int((2**height-1) * (spacing+1) + 1) 129 | # Root offset 130 | offset = int((width-1)/2) 131 | for depth in range(0, height+1): 132 | if depth > 0: 133 | # print directional lines 134 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 135 | row = self.root.getNodesAtDepth(depth, []) 136 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 137 | spacing = offset+1 138 | offset = int(offset/2) - 1 139 | print('') 140 | 141 | def traverseInorder(self): 142 | self.root.traverseInorder() 143 | 144 | def traversePreorder(self): 145 | self.root.traversePreorder() 146 | 147 | def traversePostorder(self): 148 | self.root.traversePostorder() 149 | 150 | def search(self, target): 151 | return self.root.search(target) 152 | 153 | def getNodesAtDepth(self, depth): 154 | return self.root.getNodesAtDepth(depth) 155 | 156 | def height(self): 157 | return self.root.height() 158 | 159 | def add(self): 160 | self.root.add() 161 | 162 | def delete(self, target): 163 | self.root = self.root.delete(target) 164 | 165 | unbalancedLeftLeft = Tree(Node(30), 'UNBALANCED LEFT LEFT') 166 | unbalancedLeftLeft.root.left = Node(20) 167 | unbalancedLeftLeft.root.left.right = Node(21) 168 | unbalancedLeftLeft.root.left.left = Node(10) 169 | unbalancedLeftLeft.root.left.left.left = Node(9) 170 | unbalancedLeftLeft.root.left.left.right = Node(11) 171 | unbalancedLeftLeft.print() 172 | 173 | unbalancedRightRight = Tree(Node(10), 'UNBALANCED RIGHT RIGHT') 174 | unbalancedRightRight.root.right = Node(20) 175 | unbalancedRightRight.root.right.left = Node(19) 176 | unbalancedRightRight.root.right.right = Node(30) 177 | unbalancedRightRight.root.right.right.left = Node(29) 178 | unbalancedRightRight.root.right.right.right = Node(31) 179 | unbalancedRightRight.print() 180 | 181 | 182 | unbalancedLeftRight = Tree(Node(30), 'UNBALANCED LEFT RIGHT') 183 | unbalancedLeftRight.root.right = Node(31) 184 | unbalancedLeftRight.root.left = Node(10) 185 | unbalancedLeftRight.root.left.right = Node(20) 186 | unbalancedLeftRight.root.left.left = Node(9) 187 | unbalancedLeftRight.root.left.right.left = Node(19) 188 | unbalancedLeftRight.root.left.right.right = Node(21) 189 | unbalancedLeftRight.print() 190 | 191 | 192 | unbalancedRightLeft = Tree(Node(30), 'UNBALANCED RIGHT LEFT') 193 | unbalancedRightLeft.root.left = Node(31) 194 | unbalancedRightLeft.root.right = Node(10) 195 | unbalancedRightLeft.root.right.left = Node(20) 196 | unbalancedRightLeft.root.right.right = Node(9) 197 | unbalancedRightLeft.root.right.left.right = Node(19) 198 | unbalancedRightLeft.root.right.left.left = Node(21) 199 | unbalancedRightLeft.print() 200 | -------------------------------------------------------------------------------- /03_02_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def toStr(self): 8 | if not self.isBalanced(): 9 | return str(self.data)+'*' 10 | return str(self.data) 11 | 12 | def traversePreorder(self): 13 | print(self.data) 14 | if self.left: 15 | self.left.traversePreorder() 16 | if self.right: 17 | self.right.traversePreorder() 18 | 19 | def traverseInorder(self): 20 | if self.left: 21 | self.left.traverseInorder() 22 | print(self.data) 23 | if self.right: 24 | self.right.traverseInorder() 25 | 26 | def traversePostorder(self): 27 | if self.left: 28 | self.left.traversePostorder() 29 | if self.right: 30 | self.right.traversePostorder() 31 | print(self.data) 32 | 33 | def search(self, target): 34 | if self.data == target: 35 | print("Found it!") 36 | return self 37 | 38 | if self.left and self.data > target: 39 | return self.left.search(target) 40 | 41 | if self.right and self.data < target: 42 | return self.right.search(target) 43 | 44 | print("Value is not in tree") 45 | 46 | 47 | def getNodesAtDepth(self, depth, nodes): 48 | if depth == 0: 49 | nodes.append(self) 50 | return nodes 51 | 52 | if self.left: 53 | self.left.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | 57 | if self.right: 58 | self.right.getNodesAtDepth(depth-1, nodes) 59 | else: 60 | nodes.extend([None]*2**(depth-1)) 61 | return nodes 62 | 63 | def height(self, h=0): 64 | leftHeight = self.left.height(h+1) if self.left else h 65 | rightHeight = self.right.height(h+1) if self.right else h 66 | return max(leftHeight, rightHeight) 67 | 68 | def add(self, data): 69 | if data == self.data: 70 | # Binary search tree does not contain duplicates 71 | return 72 | if data < self.data: 73 | if self.left is None: 74 | self.left = Node(data) 75 | return 76 | else: 77 | self.left.add(data) 78 | 79 | if data > self.data: 80 | if self.right is None: 81 | self.right = Node(data) 82 | return 83 | else: 84 | self.right.add(data) 85 | 86 | def findMin(self): 87 | if self.left: 88 | return self.left.findMin() 89 | return self 90 | 91 | def delete(self, target): 92 | if self.data == target: 93 | if self.right and self.left: 94 | minimumValue = self.right.findMin() 95 | self.data = minimumValue.data 96 | self.right = self.right.delete(minimumValue.data) 97 | return self 98 | else: 99 | return self.right or self.left 100 | 101 | if self.right and target > self.data: 102 | self.right = self.right.delete(target) 103 | 104 | if self.left and target < self.data: 105 | self.left = self.left.delete(target) 106 | return self 107 | 108 | def isBalanced(self): 109 | leftHeight = self.left.height()+1 if self.left else 0 110 | rightHeight = self.right.height()+1 if self.right else 0 111 | return abs(leftHeight - rightHeight) < 2 112 | 113 | class Tree: 114 | def __init__(self, root, name=''): 115 | self.root = root 116 | self.name = name 117 | 118 | def _nodeToChar(self, n, spacing): 119 | if n is None: 120 | return '_'+(' '*spacing) 121 | spacing = spacing-len(n.toStr())+1 122 | return n.toStr()+(' '*spacing) 123 | 124 | def print(self, label=''): 125 | print(self.name+' '+label) 126 | height = self.root.height() 127 | spacing = 3 128 | width = int((2**height-1) * (spacing+1) + 1) 129 | # Root offset 130 | offset = int((width-1)/2) 131 | for depth in range(0, height+1): 132 | if depth > 0: 133 | # print directional lines 134 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 135 | row = self.root.getNodesAtDepth(depth, []) 136 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 137 | spacing = offset+1 138 | offset = int(offset/2) - 1 139 | print('') 140 | 141 | def traverseInorder(self): 142 | self.root.traverseInorder() 143 | 144 | def traversePreorder(self): 145 | self.root.traversePreorder() 146 | 147 | def traversePostorder(self): 148 | self.root.traversePostorder() 149 | 150 | def search(self, target): 151 | return self.root.search(target) 152 | 153 | def getNodesAtDepth(self, depth): 154 | return self.root.getNodesAtDepth(depth) 155 | 156 | def height(self): 157 | return self.root.height() 158 | 159 | def add(self): 160 | self.root.add() 161 | 162 | def delete(self, target): 163 | self.root = self.root.delete(target) 164 | 165 | 166 | def rotateRight(root): 167 | pivot = root.left 168 | reattachNode = pivot.right 169 | root.left = reattachNode 170 | pivot.right = root 171 | return pivot 172 | 173 | def rotateLeft(root): 174 | pivot = root.right 175 | reattachNode = pivot.left 176 | root.right = reattachNode 177 | pivot.left = root 178 | return pivot 179 | 180 | unbalancedLeftLeft = Tree(Node(30), 'UNBALANCED LEFT LEFT') 181 | unbalancedLeftLeft.root.left = Node(20) 182 | unbalancedLeftLeft.root.left.right = Node(21) 183 | unbalancedLeftLeft.root.left.left = Node(10) 184 | unbalancedLeftLeft.root.left.left.left = Node(9) 185 | unbalancedLeftLeft.root.left.left.right = Node(11) 186 | unbalancedLeftLeft.print() 187 | unbalancedLeftLeft.root = rotateRight(unbalancedLeftLeft.root) 188 | 189 | unbalancedRightRight = Tree(Node(10), 'UNBALANCED RIGHT RIGHT') 190 | unbalancedRightRight.root.right = Node(20) 191 | unbalancedRightRight.root.right.left = Node(19) 192 | unbalancedRightRight.root.right.right = Node(30) 193 | unbalancedRightRight.root.right.right.left = Node(29) 194 | unbalancedRightRight.root.right.right.right = Node(31) 195 | unbalancedRightRight.print() 196 | unbalancedRightRight.root = rotateLeft(unbalancedRightRight.root) 197 | unbalancedRightRight.print() 198 | 199 | unbalancedLeftRight = Tree(Node(30), 'UNBALANCED LEFT RIGHT') 200 | unbalancedLeftRight.root.right = Node(31) 201 | unbalancedLeftRight.root.left = Node(10) 202 | unbalancedLeftRight.root.left.right = Node(20) 203 | unbalancedLeftRight.root.left.left = Node(9) 204 | unbalancedLeftRight.root.left.right.left = Node(19) 205 | unbalancedLeftRight.root.left.right.right = Node(21) 206 | unbalancedLeftRight.print() 207 | 208 | unbalancedLeftRight.root.left = rotateLeft(unbalancedLeftRight.root.left) 209 | unbalancedLeftRight.root = rotateRight(unbalancedLeftRight.root) 210 | unbalancedLeftRight.print() 211 | 212 | unbalancedRightLeft = Tree(Node(30), 'UNBALANCED RIGHT LEFT') 213 | unbalancedRightLeft.root.left = Node(31) 214 | unbalancedRightLeft.root.right = Node(10) 215 | unbalancedRightLeft.root.right.left = Node(20) 216 | unbalancedRightLeft.root.right.right = Node(9) 217 | unbalancedRightLeft.root.right.left.right = Node(19) 218 | unbalancedRightLeft.root.right.left.left = Node(21) 219 | unbalancedRightLeft.print() 220 | 221 | unbalancedRightLeft.root.right = rotateRight(unbalancedRightLeft.root.right) 222 | unbalancedRightLeft.root = rotateLeft(unbalancedRightLeft.root) 223 | unbalancedRightLeft.print() 224 | -------------------------------------------------------------------------------- /03_03_b/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def toStr(self): 8 | if not self.isBalanced(): 9 | return str(self.data)+'*' 10 | return str(self.data) 11 | 12 | def traversePreorder(self): 13 | print(self.data) 14 | if self.left: 15 | self.left.traversePreorder() 16 | if self.right: 17 | self.right.traversePreorder() 18 | 19 | def traverseInorder(self): 20 | if self.left: 21 | self.left.traverseInorder() 22 | print(self.data) 23 | if self.right: 24 | self.right.traverseInorder() 25 | 26 | def traversePostorder(self): 27 | if self.left: 28 | self.left.traversePostorder() 29 | if self.right: 30 | self.right.traversePostorder() 31 | print(self.data) 32 | 33 | def search(self, target): 34 | if self.data == target: 35 | print("Found it!") 36 | return self 37 | 38 | if self.left and self.data > target: 39 | return self.left.search(target) 40 | 41 | if self.right and self.data < target: 42 | return self.right.search(target) 43 | 44 | print("Value is not in tree") 45 | 46 | 47 | def getNodesAtDepth(self, depth, nodes): 48 | if depth == 0: 49 | nodes.append(self) 50 | return nodes 51 | 52 | if self.left: 53 | self.left.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | 57 | if self.right: 58 | self.right.getNodesAtDepth(depth-1, nodes) 59 | else: 60 | nodes.extend([None]*2**(depth-1)) 61 | return nodes 62 | 63 | def height(self, h=0): 64 | leftHeight = self.left.height(h+1) if self.left else h 65 | rightHeight = self.right.height(h+1) if self.right else h 66 | return max(leftHeight, rightHeight) 67 | 68 | def add(self, data): 69 | if data == self.data: 70 | # Binary search tree does not contain duplicates 71 | return 72 | if data < self.data: 73 | if self.left is None: 74 | self.left = Node(data) 75 | return 76 | else: 77 | self.left.add(data) 78 | 79 | if data > self.data: 80 | if self.right is None: 81 | self.right = Node(data) 82 | return 83 | else: 84 | self.right.add(data) 85 | 86 | def findMin(self): 87 | if self.left: 88 | return self.left.findMin() 89 | return self 90 | 91 | def delete(self, target): 92 | if self.data == target: 93 | if self.right and self.left: 94 | minimumValue = self.right.findMin() 95 | self.data = minimumValue.data 96 | self.right = self.right.delete(minimumValue.data) 97 | return self 98 | else: 99 | return self.right or self.left 100 | 101 | if self.right and target > self.data: 102 | self.right = self.right.delete(target) 103 | 104 | if self.left and target < self.data: 105 | self.left = self.left.delete(target) 106 | return self 107 | 108 | def isBalanced(self): 109 | leftHeight = self.left.height()+1 if self.left else 0 110 | rightHeight = self.right.height()+1 if self.right else 0 111 | return abs(leftHeight - rightHeight) < 2 112 | 113 | class Tree: 114 | def __init__(self, root, name=''): 115 | self.root = root 116 | self.name = name 117 | 118 | def _nodeToChar(self, n, spacing): 119 | if n is None: 120 | return '_'+(' '*spacing) 121 | spacing = spacing-len(n.toStr())+1 122 | return n.toStr()+(' '*spacing) 123 | 124 | def print(self, label=''): 125 | print(self.name+' '+label) 126 | height = self.root.height() 127 | spacing = 3 128 | width = int((2**height-1) * (spacing+1) + 1) 129 | # Root offset 130 | offset = int((width-1)/2) 131 | for depth in range(0, height+1): 132 | if depth > 0: 133 | # print directional lines 134 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 135 | row = self.root.getNodesAtDepth(depth, []) 136 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 137 | spacing = offset+1 138 | offset = int(offset/2) - 1 139 | print('') 140 | 141 | def traverseInorder(self): 142 | self.root.traverseInorder() 143 | 144 | def traversePreorder(self): 145 | self.root.traversePreorder() 146 | 147 | def traversePostorder(self): 148 | self.root.traversePostorder() 149 | 150 | def search(self, target): 151 | return self.root.search(target) 152 | 153 | def getNodesAtDepth(self, depth): 154 | return self.root.getNodesAtDepth(depth) 155 | 156 | def height(self): 157 | return self.root.height() 158 | 159 | def add(self): 160 | self.root.add() 161 | 162 | def delete(self, target): 163 | self.root = self.root.delete(target) 164 | 165 | def rotateRight(root): 166 | pivot = root.left 167 | reattachNode = pivot.right 168 | root.left = reattachNode 169 | pivot.right = root 170 | return pivot 171 | 172 | def rotateLeft(root): 173 | pivot = root.right 174 | reattachNode = pivot.left 175 | root.right = reattachNode 176 | pivot.left = root 177 | return pivot 178 | 179 | tree = Tree(Node(50)) 180 | tree.root.left = Node(25) 181 | tree.root.right = Node(75) 182 | tree.root.left.left = Node(10) 183 | tree.root.left.right = Node(35) 184 | tree.root.left.right.left = Node(30) 185 | tree.root.left.left.left = Node(5) 186 | tree.root.left.left.right = Node(13) 187 | tree.root.left.left.left.left = Node(2) 188 | tree.root.left.left.left.left.left = Node(1) 189 | tree.print() 190 | -------------------------------------------------------------------------------- /03_03_e/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.left = None 5 | self.right = None 6 | 7 | def toStr(self): 8 | if not self.isBalanced(): 9 | return str(self.data)+'*' 10 | return str(self.data) 11 | 12 | def traversePreorder(self): 13 | print(self.data) 14 | if self.left: 15 | self.left.traversePreorder() 16 | if self.right: 17 | self.right.traversePreorder() 18 | 19 | def traverseInorder(self): 20 | if self.left: 21 | self.left.traverseInorder() 22 | print(self.data) 23 | if self.right: 24 | self.right.traverseInorder() 25 | 26 | def traversePostorder(self): 27 | if self.left: 28 | self.left.traversePostorder() 29 | if self.right: 30 | self.right.traversePostorder() 31 | print(self.data) 32 | 33 | def search(self, target): 34 | if self.data == target: 35 | print("Found it!") 36 | return self 37 | 38 | if self.left and self.data > target: 39 | return self.left.search(target) 40 | 41 | if self.right and self.data < target: 42 | return self.right.search(target) 43 | 44 | print("Value is not in tree") 45 | 46 | 47 | def getNodesAtDepth(self, depth, nodes): 48 | if depth == 0: 49 | nodes.append(self) 50 | return nodes 51 | 52 | if self.left: 53 | self.left.getNodesAtDepth(depth-1, nodes) 54 | else: 55 | nodes.extend([None]*2**(depth-1)) 56 | 57 | if self.right: 58 | self.right.getNodesAtDepth(depth-1, nodes) 59 | else: 60 | nodes.extend([None]*2**(depth-1)) 61 | return nodes 62 | 63 | def height(self, h=0): 64 | leftHeight = self.left.height(h+1) if self.left else h 65 | rightHeight = self.right.height(h+1) if self.right else h 66 | return max(leftHeight, rightHeight) 67 | 68 | def add(self, data): 69 | if data == self.data: 70 | # Binary search tree does not contain duplicates 71 | return 72 | if data < self.data: 73 | if self.left is None: 74 | self.left = Node(data) 75 | return 76 | else: 77 | self.left.add(data) 78 | 79 | if data > self.data: 80 | if self.right is None: 81 | self.right = Node(data) 82 | return 83 | else: 84 | self.right.add(data) 85 | 86 | def findMin(self): 87 | if self.left: 88 | return self.left.findMin() 89 | return self 90 | 91 | def delete(self, target): 92 | if self.data == target: 93 | if self.right and self.left: 94 | minimumValue = self.right.findMin() 95 | self.data = minimumValue.data 96 | self.right = self.right.delete(minimumValue.data) 97 | return self 98 | else: 99 | return self.right or self.left 100 | 101 | if self.right and target > self.data: 102 | self.right = self.right.delete(target) 103 | 104 | if self.left and target < self.data: 105 | self.left = self.left.delete(target) 106 | return self 107 | 108 | def isBalanced(self): 109 | leftHeight = self.left.height()+1 if self.left else 0 110 | rightHeight = self.right.height()+1 if self.right else 0 111 | return abs(leftHeight - rightHeight) < 2 112 | 113 | def getLeftRightHeightDifference(self): 114 | leftHeight = self.left.height()+1 if self.left else 0 115 | rightHeight = self.right.height()+1 if self.right else 0 116 | return leftHeight - rightHeight 117 | 118 | def fixImbalanceIfExists(self): 119 | if self.getLeftRightHeightDifference() > 1: 120 | if self.left.getLeftRightHeightDifference() > 0: 121 | return rotateRight(self) 122 | else: 123 | self.left = rotateLeft(self.left) 124 | return rotateRight(self) 125 | 126 | if self.getLeftRightHeightDifference() < -1: 127 | if self.right.getLeftRightHeightDifference() < 0: 128 | return rotateLeft(self) 129 | else: 130 | self.right = rotateRight(self.right) 131 | return rotateLeft(self) 132 | 133 | def rebalance(self): 134 | if self.left: 135 | self.left.rebalance() 136 | self.left = self.left.fixImbalanceIfExists() 137 | if self.right: 138 | self.right.rebalance() 139 | self.right = self.right.fixImbalanceIfExists() 140 | 141 | class Tree: 142 | def __init__(self, root, name=''): 143 | self.root = root 144 | self.name = name 145 | 146 | def _nodeToChar(self, n, spacing): 147 | if n is None: 148 | return '_'+(' '*spacing) 149 | spacing = spacing-len(n.toStr())+1 150 | return n.toStr()+(' '*spacing) 151 | 152 | def print(self, label=''): 153 | print(self.name+' '+label) 154 | height = self.root.height() 155 | spacing = 3 156 | width = int((2**height-1) * (spacing+1) + 1) 157 | # Root offset 158 | offset = int((width-1)/2) 159 | for depth in range(0, height+1): 160 | if depth > 0: 161 | # print directional lines 162 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 163 | row = self.root.getNodesAtDepth(depth, []) 164 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 165 | spacing = offset+1 166 | offset = int(offset/2) - 1 167 | print('') 168 | 169 | def traverseInorder(self): 170 | self.root.traverseInorder() 171 | 172 | def traversePreorder(self): 173 | self.root.traversePreorder() 174 | 175 | def traversePostorder(self): 176 | self.root.traversePostorder() 177 | 178 | def search(self, target): 179 | return self.root.search(target) 180 | 181 | def getNodesAtDepth(self, depth): 182 | return self.root.getNodesAtDepth(depth) 183 | 184 | def height(self): 185 | return self.root.height() 186 | 187 | def add(self): 188 | self.root.add() 189 | 190 | def delete(self, target): 191 | self.root = self.root.delete(target) 192 | 193 | def rebalance(self): 194 | self.root.rebalance() 195 | self.root = self.root.fixImbalanceIfExists() 196 | 197 | def rotateRight(root): 198 | pivot = root.left 199 | reattachNode = pivot.right 200 | root.left = reattachNode 201 | pivot.right = root 202 | return pivot 203 | 204 | def rotateLeft(root): 205 | pivot = root.right 206 | reattachNode = pivot.left 207 | root.right = reattachNode 208 | pivot.left = root 209 | return pivot 210 | 211 | tree = Tree(Node(50)) 212 | tree.root.left = Node(25) 213 | tree.root.right = Node(75) 214 | tree.root.left.left = Node(10) 215 | tree.root.left.right = Node(35) 216 | tree.root.left.right.left = Node(30) 217 | tree.root.left.left.left = Node(5) 218 | tree.root.left.left.right = Node(13) 219 | tree.root.left.left.left.left = Node(2) 220 | tree.root.left.left.left.left.left = Node(1) 221 | tree.print() 222 | 223 | tree.rebalance() 224 | 225 | tree.print() 226 | -------------------------------------------------------------------------------- /03_05/tree.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.left = None 4 | self.right = None 5 | self.data = data 6 | 7 | def search(self, target): 8 | if self.data == target: 9 | print("Found it!") 10 | return self 11 | 12 | if self.left and self.data > target: 13 | return self.left.search(target) 14 | 15 | if self.right and self.data < target: 16 | return self.right.search(target) 17 | print("Does not exist") 18 | 19 | def traversePreorder(self): 20 | print(self.data) 21 | if self.left: 22 | self.left.traversePreorder() 23 | if self.right: 24 | self.right.traversePreorder() 25 | 26 | def traverseInorder(self): 27 | if self.left: 28 | self.left.traverseInorder() 29 | print(self.data) 30 | if self.right: 31 | self.right.traverseInorder() 32 | 33 | def traversePostorder(self): 34 | if self.left: 35 | self.left.traversePostorder() 36 | if self.right: 37 | self.right.traversePostorder() 38 | print(self.data) 39 | 40 | def print(self): 41 | print(self.data) 42 | 43 | def height(self, h=0): 44 | leftHeight = self.left.height(h+1) if self.left else h 45 | rightHeight = self.right.height(h+1) if self.right else h 46 | return max(leftHeight, rightHeight) 47 | 48 | def toStr(self): 49 | if not self.isBalanced(): 50 | return str(self.data)+'*' 51 | return str(self.data) 52 | 53 | def findMax(self): 54 | if self.right: 55 | return self.right.findMax() 56 | return self 57 | 58 | def findMin(self): 59 | if self.left: 60 | return self.left.findMin() 61 | return self 62 | 63 | def delete(self, data): 64 | if self.data == data: 65 | if self.right and self.left: 66 | minimumValue = self.right.findMin() 67 | self.data = minimumValue.data 68 | self.right = self.right.delete(minimumValue.data) 69 | return self 70 | else: 71 | return self.right or self.left 72 | 73 | if self.right and data > self.data: 74 | self.right = self.right.delete(data) 75 | 76 | if self.left and data < self.data: 77 | self.left = self.left.delete(data) 78 | 79 | return self.fixImbalanceIfExists() 80 | 81 | 82 | def add(self, data): 83 | if data == self.data: 84 | # Binary search tree does not contain duplicates 85 | return 86 | 87 | if data < self.data: 88 | if self.left is None: 89 | self.left = Node(data) 90 | return 91 | else: 92 | self.left.add(data) 93 | self.left = self.left.fixImbalanceIfExists() 94 | 95 | 96 | if data > self.data: 97 | if self.right is None: 98 | self.right = Node(data) 99 | return 100 | else: 101 | self.right.add(data) 102 | self.right = self.right.fixImbalanceIfExists() 103 | 104 | 105 | def getNodesAtDepth(self, depth, nodes): 106 | if depth == 0: 107 | nodes.append(self) 108 | return nodes 109 | 110 | if self.left: 111 | self.left.getNodesAtDepth(depth-1, nodes) 112 | else: 113 | nodes.extend([None]*2**(depth-1)) 114 | 115 | if self.right: 116 | self.right.getNodesAtDepth(depth-1, nodes) 117 | else: 118 | nodes.extend([None]*2**(depth-1)) 119 | return nodes 120 | 121 | def isBalanced(self): 122 | leftHeight = self.left.height()+1 if self.left else 0 123 | rightHeight = self.right.height()+1 if self.right else 0 124 | return abs(leftHeight - rightHeight) < 2 125 | 126 | def getLeftRightHeightDifference(self): 127 | leftHeight = self.left.height()+1 if self.left else 0 128 | rightHeight = self.right.height()+1 if self.right else 0 129 | return leftHeight - rightHeight 130 | 131 | def fixImbalanceIfExists(self): 132 | 133 | if self.getLeftRightHeightDifference() > 1: 134 | if self.left.getLeftRightHeightDifference() > 0: 135 | # Left left imbalance 136 | return rotateRight(self) 137 | else: 138 | # Left Right imbalance 139 | self.left = rotateLeft(self.left) 140 | return rotateRight(self) 141 | 142 | if self.getLeftRightHeightDifference() < -1: 143 | if self.right.getLeftRightHeightDifference() < 0: 144 | # Right right imbalance 145 | return rotateLeft(self) 146 | else: 147 | # Right Left imbalance 148 | self.right = rotateRight(self.right) 149 | return rotateLeft(self) 150 | 151 | return self 152 | 153 | def rebalance(self): 154 | if self.left: 155 | self.left.rebalance() 156 | self.left = self.left.fixImbalanceIfExists() 157 | if self.right: 158 | self.right.rebalance() 159 | self.right = self.right.fixImbalanceIfExists() 160 | 161 | 162 | class Tree: 163 | 164 | def __init__(self, root, name=''): 165 | self.root = root 166 | self.name = name 167 | 168 | def delete(self, data): 169 | self.root = self.root.delete(data) 170 | 171 | def add(self, data): 172 | self.root.add(data) 173 | self.root = self.root.fixImbalanceIfExists() 174 | 175 | def search(self, target): 176 | return self.root.search(target) 177 | 178 | def traverseInorder(self): 179 | self.root.traverseInorder() 180 | 181 | def traversePreorder(self): 182 | self.root.traversePreorder() 183 | 184 | def traversePostorder(self): 185 | self.root.traversePostorder() 186 | 187 | def _nodeToChar(self, n, spacing): 188 | if n is None: 189 | return '_'+(' '*spacing) 190 | spacing = spacing-len(n.toStr())+1 191 | return n.toStr()+(' '*spacing) 192 | 193 | def print(self, label=''): 194 | print(self.name+' '+label) 195 | height = self.root.height() 196 | spacing = 3 197 | width = int((2**height-1) * (spacing+1) + 1) 198 | # Root offset 199 | offset = int((width-1)/2) 200 | for depth in range(0, height+1): 201 | if depth > 0: 202 | # print directional lines 203 | print(' '*(offset+1) + (' '*(spacing+2)).join(['/' + (' '*(spacing-2)) + '\\']*(2**(depth-1)))) 204 | row = self.root.getNodesAtDepth(depth, []) 205 | print((' '*offset)+''.join([self._nodeToChar(n, spacing) for n in row])) 206 | spacing = offset+1 207 | offset = int(offset/2) - 1 208 | print('') 209 | 210 | 211 | def rebalance(self): 212 | self.root.rebalance() 213 | self.root = self.root.fixImbalanceIfExists() 214 | 215 | def treeFromList(dataList): 216 | if len(dataList) == 0: 217 | return 218 | tree = Tree(Node(dataList[0])) 219 | for item in dataList[1:]: 220 | tree.add(item) 221 | 222 | return tree 223 | 224 | 225 | def rotateRight(root): 226 | pivot = root.left 227 | reattachNode = pivot.right 228 | root.left = reattachNode 229 | pivot.right = root 230 | return pivot 231 | 232 | def rotateLeft(root): 233 | pivot = root.right 234 | reattachNode = pivot.left 235 | root.right = reattachNode 236 | pivot.left = root 237 | return pivot 238 | 239 | 240 | tree = Tree(Node(50)) 241 | tree.add(25) 242 | tree.add(75) 243 | tree.add(10) 244 | tree.add(35) 245 | tree.add(30) 246 | tree.add(5) 247 | tree.add(2) 248 | tree.add(1) 249 | tree.print() 250 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | 2 | Contribution Agreement 3 | ====================== 4 | 5 | This repository does not accept pull requests (PRs). All pull requests will be closed. 6 | 7 | However, if any contributions (through pull requests, issues, feedback or otherwise) are provided, as a contributor, you represent that the code you submit is your original work or that of your employer (in which case you represent you have the right to bind your employer). By submitting code (or otherwise providing feedback), you (and, if applicable, your employer) are licensing the submitted code (and/or feedback) to LinkedIn and the open source community subject to the BSD 2-Clause license. 8 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | LinkedIn Learning Exercise Files License Agreement 2 | ================================================== 3 | 4 | This License Agreement (the "Agreement") is a binding legal agreement 5 | between you (as an individual or entity, as applicable) and LinkedIn 6 | Corporation (“LinkedIn”). By downloading or using the LinkedIn Learning 7 | exercise files in this repository (“Licensed Materials”), you agree to 8 | be bound by the terms of this Agreement. If you do not agree to these 9 | terms, do not download or use the Licensed Materials. 10 | 11 | 1. License. 12 | - a. Subject to the terms of this Agreement, LinkedIn hereby grants LinkedIn 13 | members during their LinkedIn Learning subscription a non-exclusive, 14 | non-transferable copyright license, for internal use only, to 1) make a 15 | reasonable number of copies of the Licensed Materials, and 2) make 16 | derivative works of the Licensed Materials for the sole purpose of 17 | practicing skills taught in LinkedIn Learning courses. 18 | - b. Distribution. Unless otherwise noted in the Licensed Materials, subject 19 | to the terms of this Agreement, LinkedIn hereby grants LinkedIn members 20 | with a LinkedIn Learning subscription a non-exclusive, non-transferable 21 | copyright license to distribute the Licensed Materials, except the 22 | Licensed Materials may not be included in any product or service (or 23 | otherwise used) to instruct or educate others. 24 | 25 | 2. Restrictions and Intellectual Property. 26 | - a. You may not to use, modify, copy, make derivative works of, publish, 27 | distribute, rent, lease, sell, sublicense, assign or otherwise transfer the 28 | Licensed Materials, except as expressly set forth above in Section 1. 29 | - b. Linkedin (and its licensors) retains its intellectual property rights 30 | in the Licensed Materials. Except as expressly set forth in Section 1, 31 | LinkedIn grants no licenses. 32 | - c. You indemnify LinkedIn and its licensors and affiliates for i) any 33 | alleged infringement or misappropriation of any intellectual property rights 34 | of any third party based on modifications you make to the Licensed Materials, 35 | ii) any claims arising from your use or distribution of all or part of the 36 | Licensed Materials and iii) a breach of this Agreement. You will defend, hold 37 | harmless, and indemnify LinkedIn and its affiliates (and our and their 38 | respective employees, shareholders, and directors) from any claim or action 39 | brought by a third party, including all damages, liabilities, costs and 40 | expenses, including reasonable attorneys’ fees, to the extent resulting from, 41 | alleged to have resulted from, or in connection with: (a) your breach of your 42 | obligations herein; or (b) your use or distribution of any Licensed Materials. 43 | 44 | 3. Open source. This code may include open source software, which may be 45 | subject to other license terms as provided in the files. 46 | 47 | 4. Warranty Disclaimer. LINKEDIN PROVIDES THE LICENSED MATERIALS ON AN “AS IS” 48 | AND “AS AVAILABLE” BASIS. LINKEDIN MAKES NO REPRESENTATION OR WARRANTY, 49 | WHETHER EXPRESS OR IMPLIED, ABOUT THE LICENSED MATERIALS, INCLUDING ANY 50 | REPRESENTATION THAT THE LICENSED MATERIALS WILL BE FREE OF ERRORS, BUGS OR 51 | INTERRUPTIONS, OR THAT THE LICENSED MATERIALS ARE ACCURATE, COMPLETE OR 52 | OTHERWISE VALID. TO THE FULLEST EXTENT PERMITTED BY LAW, LINKEDIN AND ITS 53 | AFFILIATES DISCLAIM ANY IMPLIED OR STATUTORY WARRANTY OR CONDITION, INCLUDING 54 | ANY IMPLIED WARRANTY OR CONDITION OF MERCHANTABILITY OR FITNESS FOR A 55 | PARTICULAR PURPOSE, AVAILABILITY, SECURITY, TITLE AND/OR NON-INFRINGEMENT. 56 | YOUR USE OF THE LICENSED MATERIALS IS AT YOUR OWN DISCRETION AND RISK, AND 57 | YOU WILL BE SOLELY RESPONSIBLE FOR ANY DAMAGE THAT RESULTS FROM USE OF THE 58 | LICENSED MATERIALS TO YOUR COMPUTER SYSTEM OR LOSS OF DATA. NO ADVICE OR 59 | INFORMATION, WHETHER ORAL OR WRITTEN, OBTAINED BY YOU FROM US OR THROUGH OR 60 | FROM THE LICENSED MATERIALS WILL CREATE ANY WARRANTY OR CONDITION NOT 61 | EXPRESSLY STATED IN THESE TERMS. 62 | 63 | 5. Limitation of Liability. LINKEDIN SHALL NOT BE LIABLE FOR ANY INDIRECT, 64 | INCIDENTAL, SPECIAL, PUNITIVE, CONSEQUENTIAL OR EXEMPLARY DAMAGES, INCLUDING 65 | BUT NOT LIMITED TO, DAMAGES FOR LOSS OF PROFITS, GOODWILL, USE, DATA OR OTHER 66 | INTANGIBLE LOSSES . IN NO EVENT WILL LINKEDIN'S AGGREGATE LIABILITY TO YOU 67 | EXCEED $100. THIS LIMITATION OF LIABILITY SHALL: 68 | - i. APPLY REGARDLESS OF WHETHER (A) YOU BASE YOUR CLAIM ON CONTRACT, TORT, 69 | STATUTE, OR ANY OTHER LEGAL THEORY, (B) WE KNEW OR SHOULD HAVE KNOWN ABOUT 70 | THE POSSIBILITY OF SUCH DAMAGES, OR (C) THE LIMITED REMEDIES PROVIDED IN THIS 71 | SECTION FAIL OF THEIR ESSENTIAL PURPOSE; AND 72 | - ii. NOT APPLY TO ANY DAMAGE THAT LINKEDIN MAY CAUSE YOU INTENTIONALLY OR 73 | KNOWINGLY IN VIOLATION OF THESE TERMS OR APPLICABLE LAW, OR AS OTHERWISE 74 | MANDATED BY APPLICABLE LAW THAT CANNOT BE DISCLAIMED IN THESE TERMS. 75 | 76 | 6. Termination. This Agreement automatically terminates upon your breach of 77 | this Agreement or termination of your LinkedIn Learning subscription. On 78 | termination, all licenses granted under this Agreement will terminate 79 | immediately and you will delete the Licensed Materials. Sections 2-7 of this 80 | Agreement survive any termination of this Agreement. LinkedIn may discontinue 81 | the availability of some or all of the Licensed Materials at any time for any 82 | reason. 83 | 84 | 7. Miscellaneous. This Agreement will be governed by and construed in 85 | accordance with the laws of the State of California without regard to conflict 86 | of laws principles. The exclusive forum for any disputes arising out of or 87 | relating to this Agreement shall be an appropriate federal or state court 88 | sitting in the County of Santa Clara, State of California. If LinkedIn does 89 | not act to enforce a breach of this Agreement, that does not mean that 90 | LinkedIn has waived its right to enforce this Agreement. The Agreement does 91 | not create a partnership, agency relationship, or joint venture between the 92 | parties. Neither party has the power or authority to bind the other or to 93 | create any obligation or responsibility on behalf of the other. You may not, 94 | without LinkedIn’s prior written consent, assign or delegate any rights or 95 | obligations under these terms, including in connection with a change of 96 | control. Any purported assignment and delegation shall be ineffective. The 97 | Agreement shall bind and inure to the benefit of the parties, their respective 98 | successors and permitted assigns. If any provision of the Agreement is 99 | unenforceable, that provision will be modified to render it enforceable to the 100 | extent possible to give effect to the parties’ intentions and the remaining 101 | provisions will not be affected. This Agreement is the only agreement between 102 | you and LinkedIn regarding the Licensed Materials, and supersedes all prior 103 | agreements relating to the Licensed Materials. 104 | 105 | Last Updated: March 2019 106 | -------------------------------------------------------------------------------- /NOTICE: -------------------------------------------------------------------------------- 1 | Copyright 2021 LinkedIn Corporation 2 | All Rights Reserved. 3 | 4 | Licensed under the LinkedIn Learning Exercise File License (the "License"). 5 | See LICENSE in the project root for license information. 6 | 7 | Please note, this project may automatically load third party code from external 8 | repositories (for example, NPM modules, Composer packages, or other dependencies). 9 | If so, such third party code may be subject to other license terms than as set 10 | forth above. In addition, such third party code may also depend on and load 11 | multiple tiers of dependencies. Please review the applicable licenses of the 12 | additional dependencies. 13 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Python Data Structures: Trees 2 | This is the repository for the LinkedIn Learning course Python Data Structures: Trees. The full course is available from [LinkedIn Learning][lil-course-url]. 3 | 4 | ![Python Data Structures: Trees][lil-thumbnail-url] 5 | What are trees, in Python, and how do they fit in with other data structures such as linked lists and graphs? In this course, instructor Ryan Mitchell discusses binary search trees (BSTs) and what you can do with them in a real-world context. Ryan shows you how to build a basic tree with just a few lines of Python. She steps through how to search and traverse a tree, as well as how to print a tree to a terminal. Ryan explains how to add nodes to your tree, delete them, and detect unbalanced trees. When you find an unbalanced tree, it’s important to rebalance it. Ryan walks you through rebalancing four types of unbalanced trees. She concludes with a challenge that features smarter automated rebalancing. 6 | 7 | ## Instructions 8 | This repository has branches for each of the videos in the course. You can use the branch pop up menu in github to switch to a specific branch and take a look at the course at that stage, or you can add `/tree/BRANCH_NAME` to the URL to go to the branch you want to access. 9 | 10 | ## Branches 11 | The branches are structured to correspond to the videos in the course. The naming convention is `CHAPTER#_MOVIE#`. As an example, the branch named `02_03` corresponds to the second chapter and the third video in that chapter. 12 | Some branches will have a beginning and an end state. These are marked with the letters `b` for "beginning" and `e` for "end". The `b` branch contains the code as it is at the beginning of the movie. The `e` branch contains the code as it is at the end of the movie. The `main` branch holds the final state of the code when in the course. 13 | 14 | When switching from one exercise files branch to the next after making changes to the files, you may get a message like this: 15 | 16 | error: Your local changes to the following files would be overwritten by checkout: [files] 17 | Please commit your changes or stash them before you switch branches. 18 | Aborting 19 | 20 | To resolve this issue: 21 | 22 | Add changes to git using this command: git add . 23 | Commit changes using this command: git commit -m "some message" 24 | 25 | ## Installing 26 | 1. Clone this repository into your local machine using the terminal (Mac), CMD (Windows), or a GUI tool like SourceTree. 27 | 28 | 29 | 30 | ### Instructor 31 | 32 | **Ryan Mitchell** 33 | 34 | _Senior Staff Instructor at LinkedIn Learning_ 35 | 36 | Check out my other courses on [LinkedIn Learning](https://www.linkedin.com/learning/instructors/ryan-mitchell?u=104). 37 | 38 | [lil-course-url]: https://www.linkedin.com/learning/python-data-structures-trees 39 | [lil-thumbnail-url]: https://cdn.lynda.com/course/2834010/2834010-1614101495883-16x9.jpg 40 | 41 | --------------------------------------------------------------------------------