Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Here is the complete implementation of the HashTable class. This could of course be improved by using more efficient data structures and collision resolution algorithms.Exampleclass HashTable { constructor() { this.container = []; // Populate the container with empty arrays // which can be used to add more elements in // cases of collisions for (let i = 0; i < 11; i++) { this.container.push([]); } } display() { this.container.forEach((value, index) => ... Read More
To hide and show an HTML element using jQuery, use the hide and show() methods. Here, the element is hidden and shown on button click,ExampleLive Demo $(document).ready(function(){ $("#visible").click(function(){ $("p").show(); }); $("#hidden").click(function(){ $("p").hide(); }); }); This text will show on clicking "Show element" button, and hide on clicking "Hide element" button. Hide element Show element
Data hidingIn Python, we use double underscore before the attributes name to make them inaccessible/private or to hide them.The following code shows how the variable __hiddenVar is hidden.Exampleclass MyClass: __hiddenVar = 0 def add(self, increment): self.__hiddenVar += increment print (self.__hiddenVar) myObject = MyClass() myObject.add(3) myObject.add (8) print (myObject.__hiddenVar)Output 3 Traceback (most recent call last): 11 File "C:/Users/TutorialsPoint1/~_1.py", line 12, in print (myObject.__hiddenVar) AttributeError: MyClass instance has no attribute '__hiddenVar'In the above program, we tried to access hidden variable outside the class using object and it threw an ... Read More
The tree represents hierarchical structures like organization hierarchy charts, file systems, etc. To put it more formally, a tree can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated (i.e., each child has exactly one parent).
Binary Tree is a special data structure used for data storage purposes. A binary tree has a special condition that each node can have a maximum of two children. A binary tree has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in the linked list.Here is an illustration of a binary tree with some terms that we've discussed below −Important TermsFollowing are the important terms with respect to the tree.Path − Path refers to the sequence of nodes ... Read More
A Binary Search tree exhibits a special behavior. A node's left child must have a value less than its parent's value and the node's right child must have a value greater than its parent value.We'll mostly focus on such trees in this section on trees.Operations on Binary Search TreesWe'll define the following operations on the Binary Search Tree −Inserting a key into a treeIn-order traversal in a treePre-order traversal in a treePost-order traversal in a treeSearching for values in a treeSearching for minimum value in a treeSearching for maximum value in a treeRemoving a leaf node in a treeRead More
In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection. Note that a dictionary is also known as a map.The dictionary problem is a classic computer science problem: the task of designing a data structure that maintains a set of data during 'search', 'delete', and 'insert' operations. There are many different types of implementations of dictionaries. Hash Table implementation Tree-Based Implementation (Self-balancing and Unbalanced trees) List based implementationWhen to use a DictionaryDictionaries are not a silver bullet ... Read More
Let's create a MyMap class so that it doesn't hide the actual Map class in JS. We'll create a container object that'll keep track of all our values that we add to the map. We'll also create a display function that prints the map for us. Exampleclass MyMap { constructor() { this.container = {}; } display() { console.log(this.container); } }In ES6, you can directly create a dictionary using the Map class. For example, Exampleconst map1 = new Map(); const map2 = new Map([ ["key1", "value1"], ["key2", "value2"] ]);Checking if ... Read More
Now we'll create the put method that'll allow us to put key-value pairs on the dictionary. Now using this we'll implement the put method.Note that JS has objects that act quite like dictionaries. We can just set the container's key property to value. Exampleput(key, value) { this.container[key] = value; }You can test this and the previous functions using − Exampleconst myMap = new MyMap() myMap.put("key1", "value1") myMap.put("key2", "value2") myMap.display() console.log(myMap.hasKey("key1")); console.log(myMap.hasKey("key3"));OutputThis will give the output −{key1: "value1", key2: "value2"} true falseIn ES6, you can put a key-value pair in a map using the set method. For example, Exampleconst myMap ... Read More
To remove an element from the dictionary, we first need to check if it exists in the dictionary.We'll use the hasKey method for that. Then we can directly delete it using the delete operator.We'll return a Boolean so that the place where we call this method can know whether the key already existed or not in the dictionary. Exampledelete(key) { if(this.hasKey(key)) { delete this.container[key]; return true; } return false; }You can test this using − Exampleconst myMap = new MyMap(); myMap.put("key1", "value1"); myMap.put("key2", "value2"); myMap.display(); myMap.delete("key2"); myMap.display();OutputThis will give the output ... Read More