MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / Node

Class Node

data_structures/binary tree/binary_search_tree.py:5–36  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

3'''
4from __future__ import print_function
5class Node:
6
7 def __init__(self, label, parent):
8 self.label = label
9 self.left = None
10 self.right = None
11 #Added in order to delete a node easier
12 self.parent = parent
13
14 def getLabel(self):
15 return self.label
16
17 def setLabel(self, label):
18 self.label = label
19
20 def getLeft(self):
21 return self.left
22
23 def setLeft(self, left):
24 self.left = left
25
26 def getRight(self):
27 return self.right
28
29 def setRight(self, right):
30 self.right = right
31
32 def getParent(self):
33 return self.parent
34
35 def setParent(self, parent):
36 self.parent = parent
37
38class BinarySearchTree:
39

Callers 1

insertMethod · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected