Please enable JavaScript.
Coggle requires JavaScript to display documents.
Counter of Ordered Frequency Words, kiln - Coggle Diagram
Counter of Ordered Frequency Words
How to memorize algorithms?
Breack into simple concepts and stories rather than raw code.
What is the goal?
I'm building an
AVL Tree
Compare both concepts in:
Insertion Time
Search Time
Tree Height
Performance Test Loop
for each data size (100, 500, 1000, 5000, 10000, 20000)
IIt may choose randomly...
AVL
Both measure:
How long it takes to insert all the values.
Search for all the values.
Print the entire time and tree height.
BST Tree
Plotting
Insertion Performance vs Elements
Seach Performance vs Elements
Class Arbre
It does 3 things:
Insertion
Add nodes while keeping the tree balanced.
Rotation
When the tree is leaning too much, fix it!
Balance Checking
Before returning a node, check:
balance factor = left height - right height
If it's more than 1 or less than -1, ROTATE
A basic Binary Search Tree
No rotation
Just insert, search and calculate height recursively
Event2
*Every Element is an Event2 with a:
timestamp
description
pointers to left, right, parent
height for AVL.
kiln
metodo de la multiplicacion
metodo de la division
parte fraccionaria