A class that implements the Set interface using a binary search tree

关注

原创最新推荐文章于 2025-02-28 12:59:57 发布 767 阅读 AI 写同款· GEO 优化 ›

Java实现：二叉搜索树(Binary Search Tree) 目录一、二叉搜索树二、完整代码实现（Java） 1、二叉搜索树 1.1、基本概念二叉树的一个性质是一棵平均二叉树的深度要比节点个数N小得多。分析表明其平均深度为 O(√N)O(N) ,而对于特殊类型的二叉树，即二叉查找树(binary search tree),其深度的平均值为 O(logN)O(logN) 。二叉查找树的性质：对于树中的每个节点X，它的左子树中所有项的值小于X中的项，而它的右子树中所有项的值大于X中的项。由于树的递归定义，通常是递归地编写那些操作的例程。因为二叉查找阅读详情

The major hurdle is that our class does not implement Iterable. To overcome this, we augment the BinaryNode inner class by adding links to the next smallest and next largest nodes so that the iterator can efficiently return the next node (just like a linked list). Rewrite the insert method of MyBinarySearchTree to support the added links.

We first augment the data structure so that the inner class becomes:

private static class BinaryNode

{

...

AnyType element; // The data in the node

BinaryNode<AnyType> left; // Left child

BinaryNode<AnyType> right; // Right child

BinaryNode<AnyType> smaller; // Previous in-order element

BinaryNode<AnyType> larger; // Next in-order element

}

Here is the insert method:

private BinaryNode<T> insert(T x, BinaryNode<T> t, BinaryNode<T> larger, BinaryNode<T> smaller)

{

if (t == null)

{

BinaryNode<T> n = new BinaryNode<T>(x, null, null, larger, smaller);

if (larger != null) larger.prev = n;

if (smaller != null) smaller.next = n;

return n;

}

int compareResult = x.compareTo(t.element);

if (compareResult < 0)

t.left = insert(x, t.left, t, smaller);

else if (compareResult > 0)

t.right = insert(x, t.right, larger, t);

else

; // duplicate

return t;

}

When a new node is inserted as a left child, three things must be done to support this augmentation: its larger field must point to its parent; its smaller field must be set to its parent's smaller field; and the parent's smaller field must be set to it. A similar triplet of changes is needed when the new node is a right child.