quick-references
Binary Search Tree vs Avl Tree
The binary search tree is a tree data structure that follows the condition of the binary tree. As we know, that tree can have 'n' number of children, whereas; the binary tree can contain the utmost two children. An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one.
Posted September 12, 2022 by Rohith and Anusha ‐ 3 min read
⌖ quick-references blog binary-search-tree avl-tree differences
Red Black Tree vs Avl Tree
An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees cannot be more than one. A Red Black Tree is a category of the self-balancing binary search tree.
Delete vs Drop
Delete is a Data Manipulation Language command, DML command and is used to remove tuples/records from a relation/table. Whereas Drop is a Data Definition Language, DDL command and is used to remove named elements of schema like relations/table, constraints or entire schema.
Delete vs Truncate
Both the Truncate statement and the Delete statement are included in the category of SQL queries for deleting the data stored in a table. They carry out deletion operations on records or rows of a table that are no longer needed.
Posted September 12, 2022 by Rohith ‐ 2 min read
Linear Search vs Binary Search
Linear search is a search that finds an element in the list by searching the element sequentially until the element is found in the list. On the other hand, a binary search is a search that finds the middle element in the list recursively until the middle element is matched with a searched element.
Posted September 12, 2022 by Rohith and Anusha ‐ 2 min read
⌖ quick-references blog linear-search binary-search differences