trees package

Subpackages

• trees.bin package
  • Submodules
  • trees.bin.tree_cli module
    • cli
      • cli.do_build()
      • cli.do_delete()
      • cli.do_destroy()
      • cli.do_detail()
      • cli.do_exit()
      • cli.do_insert()
      • cli.do_search()
      • cli.do_traverse()
      • cli.intro
      • cli.prompt
    • main()
  • Module contents
• trees.binary_trees package
  • Submodules
  • trees.binary_trees.avl_tree module
    • AVLNode
      • AVLNode.height
      • AVLNode.left
      • AVLNode.parent
      • AVLNode.right
    • AVLTree
      • AVLTree.root
      • AVLTree.empty
      • AVLTree.search()
      • AVLTree.insert()
      • AVLTree.delete()
      • AVLTree.get_leftmost()
      • AVLTree.get_rightmost()
      • AVLTree.get_successor()
      • AVLTree.get_predecessor()
      • AVLTree.get_height()
      • AVLTree.delete()
      • AVLTree.get_height()
      • AVLTree.get_leftmost()
      • AVLTree.get_predecessor()
      • AVLTree.get_rightmost()
      • AVLTree.get_successor()
      • AVLTree.insert()
      • AVLTree.search()
  • trees.binary_trees.binary_search_tree module
    • BinarySearchTree
      • BinarySearchTree.root
      • BinarySearchTree.empty
      • BinarySearchTree.search()
      • BinarySearchTree.insert()
      • BinarySearchTree.delete()
      • BinarySearchTree.get_leftmost()
      • BinarySearchTree.get_rightmost()
      • BinarySearchTree.get_successor()
      • BinarySearchTree.get_predecessor()
      • BinarySearchTree.get_height()
      • BinarySearchTree.delete()
      • BinarySearchTree.get_height()
      • BinarySearchTree.get_leftmost()
      • BinarySearchTree.get_predecessor()
      • BinarySearchTree.get_rightmost()
      • BinarySearchTree.get_successor()
      • BinarySearchTree.insert()
      • BinarySearchTree.search()
  • trees.binary_trees.binary_tree module
    • BinaryTree
      • BinaryTree.root
      • BinaryTree.delete()
      • BinaryTree.empty
      • BinaryTree.get_height()
      • BinaryTree.get_leftmost()
      • BinaryTree.get_predecessor()
      • BinaryTree.get_rightmost()
      • BinaryTree.get_successor()
      • BinaryTree.insert()
      • BinaryTree.search()
    • Node
      • Node.data
      • Node.key
      • Node.left
      • Node.parent
      • Node.right
    • NodeType
    • Pairs
  • trees.binary_trees.red_black_tree module
    • Color
      • Color.BLACK
      • Color.RED
    • LeafNode
      • LeafNode.color
      • LeafNode.data
      • LeafNode.key
      • LeafNode.left
      • LeafNode.parent
      • LeafNode.right
    • RBNode
      • RBNode.color
    • RBTree
      • RBTree.root
      • RBTree.empty
      • RBTree.search()
      • RBTree.insert()
      • RBTree.delete()
      • RBTree.inorder_traverse()
      • RBTree.preorder_traverse()
      • RBTree.postorder_traverse()
      • RBTree.get_leftmost()
      • RBTree.get_rightmost()
      • RBTree.get_successor()
      • RBTree.get_predecessor()
      • RBTree.get_height()
      • RBTree.delete()
      • RBTree.get_height()
      • RBTree.get_leftmost()
      • RBTree.get_predecessor()
      • RBTree.get_rightmost()
      • RBTree.get_successor()
      • RBTree.inorder_traverse()
      • RBTree.insert()
      • RBTree.postorder_traverse()
      • RBTree.preorder_traverse()
      • RBTree.search()
  • trees.binary_trees.threaded_binary_tree module
    • DoubleThreadNode
      • DoubleThreadNode.left
      • DoubleThreadNode.leftThread
      • DoubleThreadNode.parent
      • DoubleThreadNode.right
      • DoubleThreadNode.rightThread
    • DoubleThreadedBinaryTree
      • DoubleThreadedBinaryTree.root
      • DoubleThreadedBinaryTree.empty
      • DoubleThreadedBinaryTree.search()
      • DoubleThreadedBinaryTree.insert()
      • DoubleThreadedBinaryTree.delete()
      • DoubleThreadedBinaryTree.inorder_traverse()
      • DoubleThreadedBinaryTree.preorder_traverse()
      • DoubleThreadedBinaryTree.reverse_inorder_traverse()
      • DoubleThreadedBinaryTree.get_leftmost()
      • DoubleThreadedBinaryTree.get_rightmost()
      • DoubleThreadedBinaryTree.get_successor()
      • DoubleThreadedBinaryTree.get_predecessor()
      • DoubleThreadedBinaryTree.get_height()
      • DoubleThreadedBinaryTree.delete()
      • DoubleThreadedBinaryTree.get_height()
      • DoubleThreadedBinaryTree.get_leftmost()
      • DoubleThreadedBinaryTree.get_predecessor()
      • DoubleThreadedBinaryTree.get_rightmost()
      • DoubleThreadedBinaryTree.get_successor()
      • DoubleThreadedBinaryTree.inorder_traverse()
      • DoubleThreadedBinaryTree.insert()
      • DoubleThreadedBinaryTree.preorder_traverse()
      • DoubleThreadedBinaryTree.reverse_inorder_traverse()
      • DoubleThreadedBinaryTree.search()
    • LeftThreadedBinaryTree
      • LeftThreadedBinaryTree.root
      • LeftThreadedBinaryTree.empty
      • LeftThreadedBinaryTree.search()
      • LeftThreadedBinaryTree.insert()
      • LeftThreadedBinaryTree.delete()
      • LeftThreadedBinaryTree.reverse_inorder_traverse()
      • LeftThreadedBinaryTree.get_leftmost()
      • LeftThreadedBinaryTree.get_rightmost()
      • LeftThreadedBinaryTree.get_successor()
      • LeftThreadedBinaryTree.get_predecessor()
      • LeftThreadedBinaryTree.get_height()
      • LeftThreadedBinaryTree.delete()
      • LeftThreadedBinaryTree.get_height()
      • LeftThreadedBinaryTree.get_leftmost()
      • LeftThreadedBinaryTree.get_predecessor()
      • LeftThreadedBinaryTree.get_rightmost()
      • LeftThreadedBinaryTree.get_successor()
      • LeftThreadedBinaryTree.insert()
      • LeftThreadedBinaryTree.reverse_inorder_traverse()
      • LeftThreadedBinaryTree.search()
    • RightThreadedBinaryTree
      • RightThreadedBinaryTree.root
      • RightThreadedBinaryTree.empty
      • RightThreadedBinaryTree.search()
      • RightThreadedBinaryTree.insert()
      • RightThreadedBinaryTree.delete()
      • RightThreadedBinaryTree.inorder_traverse()
      • RightThreadedBinaryTree.preorder_traverse()
      • RightThreadedBinaryTree.get_leftmost()
      • RightThreadedBinaryTree.get_rightmost()
      • RightThreadedBinaryTree.get_successor()
      • RightThreadedBinaryTree.get_predecessor()
      • RightThreadedBinaryTree.get_height()
      • RightThreadedBinaryTree.delete()
      • RightThreadedBinaryTree.get_height()
      • RightThreadedBinaryTree.get_leftmost()
      • RightThreadedBinaryTree.get_predecessor()
      • RightThreadedBinaryTree.get_rightmost()
      • RightThreadedBinaryTree.get_successor()
      • RightThreadedBinaryTree.inorder_traverse()
      • RightThreadedBinaryTree.insert()
      • RightThreadedBinaryTree.preorder_traverse()
      • RightThreadedBinaryTree.search()
    • SingleThreadNode
      • SingleThreadNode.isThread
      • SingleThreadNode.left
      • SingleThreadNode.parent
      • SingleThreadNode.right
  • trees.binary_trees.traversal module
    • Routines
    • inorder_traverse()
    • levelorder_traverse()
    • postorder_traverse()
    • preorder_traverse()
    • reverse_inorder_traverse()
  • Module contents

Submodules

trees.tree_exceptions module

Tree Exception Definitions.

exception trees.tree_exceptions.DuplicateKeyError(key)

Bases: Exception

Raised when a key already exists.

exception trees.tree_exceptions.EmptyTreeError

Bases: Exception

Raised when a tree is empty.

exception trees.tree_exceptions.KeyNotFoundError(key)

Bases: Exception

Raised when a key does not exist.

Module contents