二分查找树的增,删,查
二分查找树
python
from pprint import pformat
class Node:
def __init__(self, value, parent):
self.value = value
self.left = None
self.right = None
self.parent = parent
def __repr__(self):
if self.left is None an
原创
2020-07-06 01:55:17 ·
168 阅读 ·
0 评论
关注
分享
扫一扫