Python BinarySearchTree.getMax示例

示例#1

newBST.insert(90)
newBST.insert(1)
newBST.insert(-2)

print("=====")

newBST.traverseInOrder()

print("=====")

newBST.remove(42)
newBST.traverseInOrder()

print("=====")

print(newBST.getMax())

print("=====")

print(newBST.getMin())

print("=====")

newBST.remove(12)
newBST.traverseInOrder()

print("=====")

newBST.insert(45)

newBST.traverseInOrder()

示例#2

文件： App.py 项目： cogfor/AlgorithmsAndDatastructuresPython

# -*- coding: utf-8 -*-

"""
App:
"""

from BinarySearchTree import BinarySearchTree as BST

bst = BST()

bst.insert(12)
bst.insert(10)
bst.insert(-2)
bst.insert(1)

bst.traverseInOrder()

bst.remove(10)

bst.traverseInOrder()

print bst.getMin()
print bst.getMax()

示例#3

# -*- coding: utf-8 -*-
"""
App:
"""

from BinarySearchTree import BinarySearchTree as BST

bst = BST()

bst.insert(12)
bst.insert(10)
bst.insert(-2)
bst.insert(1)

bst.traverseInOrder()

bst.remove(10)

bst.traverseInOrder()

print bst.getMin()
print bst.getMax()