Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
We can learn how we can insert a node in an AVL Tree. Insertions in AVL trees are the same as BST, we just need to perform one extra step called balance tree during insert whenever we move down the tree.This requires calculating the balance factor which we already saw before. And according to the configurations, we need to call appropriate rotation methods. These are pretty intuitive with the help of the above explanation.We again create a class method and a helper function for recursive calls − Exampleinsert(data) { let node = new this.Node(data); // Check if the tree ... Read More
Here is the complete implementation of the AVL Tree Class −Exampleclass AVLTree { constructor() { // Initialize a root element to null. this.root = null; } getBalanceFactor(root) { return this.getHeight(root.left) - this.getHeight(root.right); } getHeight(root) { let height = 0; if (root === null || typeof root == "undefined") { height = -1; } else { height = Math.max(this.getHeight(root.left), this.getHeight(root.right)) + 1; } ... Read More
The HTML tag is used for declaring a script within your HTML document. Through this, you can define client-side JavaScript. But, what if you want to add external JavaScript inside an HTML Page? Well, you can easily do that too using the src attribute of the tag.The following are the attributes of the tag −AttributeValueDescriptionasyncasyncSpecifies that the script is executed asynchronously.charsetcharsetDefines the character encoding that the script uses.deferdeferDeclares that the script will not generate any content. Therefore, the browser/user agent can continue parsing and rendering the rest of the page.srcURLSpecifies a URI/URL of an external script.typetext/JavaScript application/ecmascript ... Read More
A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. The interconnected objects are represented by points termed as vertices, and the links that connect the vertices are called edges.Formally, a graph is a pair of sets (V, E), where V is the set of vertices and E is the set of edges, connecting the pairs of vertices. Take a look at the following graph −In the above graph, V = {a, b, c, d, e} E = {ab, ac, bd, cd, de}TerminologyMathematical graphs can be represented in the data ... Read More
With HTML, the essentials are doctype declaration, and . But, you will be amazed to know that a valid HTML document can work without the and element. The doctype declaration will come always since it tells and instructs the browser about what the page is about.Let’s see an example; here we won’t use the html> and element. Still, the HTML Document is valid and will work correctly like any other valid HTML Document − Title of the page This is heading 1 This is heading 2 This is a paragraph.
This method returns a CanvasGradient object that represents a radial gradient that paints along the cone given by the circles represented by the arguments. The first three arguments define a circle with coordinates (x1, y1) and radius r1 and the second a circle with coordinates (x2, y2) and radius r2.createRadialGradient(x0, y0, r0, x1, y1, r1)Here are the parameter values of the createRadialGradient() method −S.NoParameter & Description1x0x-coordinate- Starting point of the gradient2y0y- coordinate - Starting point of the gradient3r0Radius of the starting circle4x1x-coordinate - Ending point of the gradient5y1y- coordinate - Ending point of the gradient6r1Radius of the ending circleYou can ... Read More
In Python 2.x there's two styles of classes depending on the presence or absence of a built-in type as a base-class −"classic" style or old style classes have no built-in type as a base class: >>> class OldSpam: # no base class ... pass >>> OldSpam.__bases__ ()"New" style classes: they have a built-in type as a base class meaning that, directly or indirectly, they have object as a base class −>>> class NewSpam(object): # directly inherit from object ... pass >>> NewSpam.__bases__ (, ) >>> class IntSpam(int): ... Read More
We'll be creating a graph class that supports weights and both directed and undirected types. This will be implemented using an adjacency list. As we move to more advanced concepts, both weights and directed nature of the graphs will come in handy.An adjacency list is an array A of separate lists. Each element of the array Ai is a list, which contains all the vertices that are adjacent to vertex i. We're defining it using 2 members, nodes and edges.Let's set up the graph class by defining our class and some methods that we'll use to add nodes and edges ... Read More
Graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph. Such traversals are classified by the order in which the vertices are visited.
BFS visits the neighbor vertices before visiting the child vertices, and a queue is used in the search process. Following is how a BFS works −Visit the adjacent unvisited vertex. Mark it as visited. Display it. Insert it in a queue.If no adjacent vertex is found, remove the first vertex from the queue.Repeat Rule 1 and Rule 2 until the queue is empty.Let us look at an illustration of how BFS Traversal works:StepTraversalDescription1Initialize the queue.2We start by visiting S (starting node) and mark it as visited.3We then see an unvisited adjacent node from S. In this example, we have three ... Read More