Channi Studies

File SystemsTrees are commonly used to represent hierarchical data. A tree represent files and directories in a file system, since a file system is a hierarchy. A file in a file system tree is alwyas a leaf node. A directory in a file system tree can be both leaf node or internal node. Unlike binary trees that have a fixed number of children per node (0-2), a file system tree must support a vari..

Binary Tree In a list, each node has up to one successor. In a binary tree, each node has up to two children, known as a left child and a right child. "Binary" means two, referring to the two children. Some more definitions related to a binary tree:Leaf: A tree node with no children.Internal node: A node with at least one child.Parent: A node with a child is said to be that child's parent. A nod..

In this post, we will finally take a look into Python implementation of hash tables.  HashTable base class# Base class for a hash table that supports the insert, remove, and search # operations.class HashTable: # Returns a non-negative hash code for the specified key. def hashKey(self, key): return abs(hash(key)) # Inserts the specified key/value pair. If the key already exis..

A hash function is fast if the hash function can minimize collisions.  A perfect hash fucntion maps items to buckets with no collisions.It can be created if the number of items and all possible item keys are known beforehand.The runtime for insert, serach and remove is O(1) with it.  A good hash function should uniformly distribute items into buckets.With chaining, a good hash function results i..