21 lines
431 B
Python
21 lines
431 B
Python
class TreeNode:
|
|
def __init__(self, data, left=None, right=None):
|
|
self.data = None
|
|
self.left = None
|
|
self.right = None
|
|
|
|
def __str__(self):
|
|
fmt = 'TreeNode(data={}, left={}, right={})'
|
|
return fmt.format(self.data, self.left, self.right)
|
|
|
|
|
|
class BinarySearchTree:
|
|
def __init__(self, tree_data):
|
|
pass
|
|
|
|
def data(self):
|
|
pass
|
|
|
|
def sorted_data(self):
|
|
pass
|