updated: Wednesday, 6th April 2022

Simplicity meets intelligence

dataStax

What's New?

• Added Mandatory Keyword arguments to avoid confusion in:
  • Arrays
  • ThreadedBinaryTree
• Added High Quality PNGs in README.md

Table of Contents

• Introduction
• Problem Statement
• Benefits
• Requirements
• Installation
• Usage
• What's Next

Introduction

• This is a very simple yet powerful project to implement day to day abstract data structures
• A pure implementation of Python in representing Tree, Linkedlist and Array based datastructures in basic command prompt
• It helps visualize each data structure for better understanding
• Students can be beneficial in using this Package
• This project is still under construction

Problem Statement

• Often at the beginning of B.Tech Course, CS students face a lot of problems understanding the internal architecture of complex ADTs.
• While solving coding challenges locally where test cases have to be written using these ADTs, it becomes really cumbersome to write these data structures from scratch.
• Also, when writing programs which implements these ADS, we encounter lots of errors just because we are unable to preview what's actually going on under the hood.

Benefits

• Instant installation
• Quick Updates
• Very small size
• No extra modules required
• Written purely from scratch
• Easy Documentation [Upcoming]
• Command Line Demo

Requirements

• Runs on latest Python 3.7+
• (WARNING: Though the module might run on py 3.7 error free, but it has been tested for 3.9+)
• (Suggesting you to always update to the latest python version)
• This Library requires no extra modules

Installation

1. Use the python package manager pip to install datastax.

pip install datastax

Usage

Demo

• To get a demo of the library use the following command

  • Windows:

  > py -m datastax 
  

  • Unix based systems:

  $ python3 -m datastax
  

  • Result

  Available modules are:
  1. LinkedLists
  2. Trees
  3. Arrays
  
  Usage
  > py datastax <data-structure> [data]
  Data Structures:
  ->  trees          Hierarchical DS
  ->  linkedlists    Linear DS
  ->  arrays         Fixed Size Linear DS
  

• Then follow as the instruction guides

> py -m datastax linkedlist 1 2 3 4
  Visuals for LinkedLists:

  1. Singly Linked List:
     HEAD                                         TAIL
 ┌─────╥────┐   ┌─────╥────┐   ┌─────╥────┐   ┌─────╥────┐
 │  1  ║  ----->│  2  ║  ----->│  3  ║  ----->│  4  ║  -----> NULL
 └─────╨────┘   └─────╨────┘   └─────╨────┘   └─────╨────┘


  2. Doubly Linked List:
               HEAD                                                        TAIL
         ┌────╥─────╥────┐   ┌────╥─────╥────┐   ┌────╥─────╥────┐   ┌────╥─────╥────┐
 NULL <-----  ║  1  ║  <------->  ║  2  ║  <------->  ║  3  ║  <------->  ║  4  ║  -----> NULL
         └────╨─────╨────┘   └────╨─────╨────┘   └────╨─────╨────┘   └────╨─────╨────┘
  ...

Practical Usage

• Queue

• BinaryTree

• MinHeapTree

• ThreadedBinaryTree

• SumSegmentTree

• HuffmanTree

• RedBlackTree

What's Next

• Enhanced Documentation
• Better TestCases for Huffman Tree
• Better TestCases for Segment Trees
• Test Cases for Fibonacci Tree