Advanced Data Structures

Implementation of Leftist Tree and Binomial Heap

Status: Abandoned

Brought to you by: dhananjayb

Downloads: 0 This Week

Last Update: 2016-09-23

Add to Preferred Sources

The project implements two advanced data structures namely Binomial Heap and Leftist Tree.
Project runs in two modes
random mode: which determines average cost required to perform single operation on both data structures.
user mode: where user performs series of operation on these data structures from input file which also displays the final tree after all operations.

Features

Binomial Heap
Leftist Tree

Project Activity

See All Activity >

Follow Advanced Data Structures

Advanced Data Structures Web Site

Other Useful Business Software

$300 Free Credits to Build on Google Cloud Icon

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Rate This Project

Login To Rate This Project

User Reviews

Be the first to post a review of Advanced Data Structures!

Additional Project Details

Registered

2013-06-26

Report inappropriate content

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Start Free

Recommended Projects

Generic Data Structures Library
The Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. It is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.
Rand Tree
Random Tree Generator for MatLab
Erwin Data Structures and Tools
Tool for generating libraries of void*-free data structures in C and C++. No C++ templates: files are generated. Some tools are included: assertion macros, symbols, C interface wrap around C++ libs, extract docs.
JavaScript Algo and Data Structures
Algorithms and data structures implemented in JavaScript
Vtgrep
Vtgrep stands for Visual Tree Grep and is a GUI to tgrep. It allows the user to build graphical representations of tree structures and then translates them into the tgrep syntax. provides search functionality, as well as search and result logging.