Partitioned Binary Search Tree

P(n)-BST  

    
Professor D.E. ZEGOUR in collaboration with S. ABBAR et M.E.A. CHOUIHA. 

(Applet realized by S. ABBAR et M.E.A. CHOUIHA)
                                                 

Input

values between 0 and 99

Rand

generating a random positive value

Output

Comments on the current operation

New

Initializing (PBST, PBST_r ou PBST_rlink).

Partition parameter

modifying the parameter of the P(n)-BST structure

Insert

Inserting a value

Multiple_Insert

Inserting several values

Search

searching a value

Delete

deleting a value.

Range query

searching all the values between two given values

Re-partitioning

Re partitionning the PBST structure with a new parameter

Previous node_partition

searching the previous inorder partition node

Next node_partition

searching  the next inorder partition node.

nth node_partition

searching the n-st inorder partition node