Free Online Tutorial For Programmers, Contains a Solution For Question in Programming. Quizzes and Practice / Company / Test interview Questions.
[su_youtube url="https://youtu.be/PgexmiPps2o" title="Binary Search Tree"] [su_youtube url="https://youtu.be/IoSVVlDz7b4" title="AVL Tree"] Binary Search Tree Definition: Is an ordered tree Is a binary tree where nodes with lesser values are placed to the left of the root node and nodes with equal or greater values are placed to the right Rules Rule 1:…
[su_youtube url="https://youtu.be/wr3mQ3GmQAc" title="Binary Tree"] Binary Tree What is a binary tree? The binary tree starts from the root node The root node has no parent Nodes have at most two children or 1 or 0 We refer to the children as left and right They are recursively defined Every node…
[su_youtube url="https://youtu.be/2IhBtV2kYf8" title="Tree Data structure"] [su_youtube url="https://youtu.be/1vv2hHSxQMg" title="Properties of Tree Data structure"] [su_youtube url="https://youtu.be/k7fNwaBSTM0" title="Types of Tree Data structure"] Tree What is a tree? A tree is a data structure that represents hierarchical data The nodes in the tree have a 1:N parent-child relationship Every tree has a root…
[su_youtube url="https://youtu.be/JagMrQMvWBk" title="Queue"] [su_youtube url="https://youtu.be/9aqkEoJO65o" title="Types of Queue"] Queues What are queues? The queues are First in First out (FIFO) data structures Its the opposite of stacks The printer is the best example of a queue Doubly ended queues Its a data structure which is both First in First out…
[su_youtube url="https://youtu.be/KP8Lw2FD6x0" title="Stack"] Stacks What are stacks? The stacks are Last in First out (LIFO) data structures Stack is like a pile of plates In the beginning, the pile may be empty, but eventually, a plate can be added to the pile Only the most recently added plate can be…
[su_youtube url="https://youtu.be/yPV4TH45zFc" title="Linked List"] Linked list What is a linked list? Are container where data is stored in nodes The nodes consist single data item and pointer/reference to the next node What is a node? The node is nothing but a link in the linked list The node contains two…
Data structures and algorithms Course Overview: This course covers the concept of data structure and algorithms All data structures have been explained with introduction, advantages and disadvantages The good images have been attached for every chapter which makes it easy to understand the concepts The algorithms have been explained with…
[su_youtube url="https://youtu.be/dtyH9XW3VDI" title="Arrays"]What is an array? An array is a collection of data items These items are similar types An array can also be called a list Properties an array An array can contain a group of elements of a similar type Array elements are stored in contiguous memory blocks…
Nullish coalescing operator The nullish coalescing operator(??) is a logical operator Returns its right-hand side operand when its left-hand side operand is null or undefined, and otherwise returns its left-hand side operand const name = null ?? 'John'; console.log(name); // John
How to avoid common errors in Javascript Introduction Now we have learned about error types and how to debug the errors Now there is a standard way of coding which can help in avoiding most of the common error types like ReferenceError and TypeError Use try-catch block To avoid errors…