Happy monday everyone! how was your weekend? did you do something fun? 🤗 my weekend was interesting, it was a mix of working hard and spending time with @kimo_dev
playing tutti frutti and hangman over facetime 💻. have you ever played tutti frutti or hangman? on another note, i’m also very excited to see kimo again! he will be coming to america 🇺🇸 for the first time in 3 weeks. 3 weeks! let’s be real, long distance relationships are a struggle but his love is worth all the waiting, texting and calling 💕. we have a lot of traveling already planned, some of the places we will be visiting include washington dc and new york 🗽
i want to say a hugeee thank you to @delanceyusa
for this gorgeous and stylish dark brown pu leather desk mat. get over to their site to get yours today! #delanceyusa
🌀 breadth first searching algorithm is used to search for a node in a graph data structure. the algorithm starts at one node, then goes to its neighboring nodes. if the node we are searching for is not found, then it will go to the next node look at its neighbors.
🌀 depth first searching algorithm is a traversal algorithm that starts searching at one node, and then goes down the path of its neighboring nodes before it goes to the other paths.
🌀 binary tree traversal algorithms is a tree data structure where each node can only have up to two child nodes.
until next time, have a lovely week everyone 🌸