“The journey of a thousand miles begins with a single step”
– Lao Tzu
Welcome!
Hey there! You have come to my blog. Enjoy your stay while you’re here. And while you’re at it, let’s keep an open mind and heart!
Red-Black Trees
Briefly discuss how the color rules help with balancing the tree (write a bit about 2-4 trees). Compare the performance of this red black tree to a random binary search tree or treap. The four color rules of the red-black tree help the tree maintain a structure that is balanced. To understand more on red-black…
A*
What difference is there between the A* algorithm and Dijkstra’s algorithm? (in terms of nodes explored) The difference between A* and Dijkstra’s algorithm in terms of nodes explored is that A* is less greedy and has a more educated guess h, the heuristic functions that helps us lessen the nodes explored. In Dijkstra’s, as it…
Random Trees
When would you use a binary search tree over a treap? I think I would use a binary search tree over a treap in terms of complexity in implementation. Binary search trees are simpler. However, practical-wise, I would use a binary search three if I have a set of numbers that are sorted randomly because…
Something went wrong. Please refresh the page and/or try again.
Follow My Blog
Get new content delivered directly to your inbox.
Chav's Blog 