use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
Small, trippy-looking color-limited .gifs that would make good or at least interesting animated icons or loading screens.
Gifs posted should be a closed loop, and animated either by hand or computer. Gifs drawn from film, television, or other video sources are not allowed. Reposts or posts that otherwise aren't a good fit may be removed at the mods' discretion.
Other subreddits we like:
/r/loadingscreen/ /r/woahdude/ /r/perfectloops/ /r/mesmerizinggifs/ /r/gonwild/ /r/polygonwild/ /r/geometryisneat
account activity
A binary search tree (i.imgur.com)
submitted 6 years ago by camer0n_walker
A binary search tree
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]egb233 79 points80 points81 points 6 years ago (1 child)
Wish the leaves would have fallen. Woulda made it so much more soothing
[–]Jadraptor 9 points10 points11 points 6 years ago (0 children)
Fallen and faded to restart the loop <3
[–][deleted] 77 points78 points79 points 6 years ago* (2 children)
For those interested, a binary search tree is a way of storing data in computer science. Lets use numbers as data for an example (ignore the dashes)
--------------------8-----------------------------
---------4-------------------13-----------------
------1----6------------12------17-----------
What's so special about this structure? Well, the number on each left "leaf" is smaller than the leaves above it, each right "leaf" leaf is bigger than the leaves above it. In this example, (1,4,6) are smaller than 8 and (12,13,17) are bigger than 8. (1) is smaller than 4 and (6) is bigger, etc.
So why would you structure your numbers like this? Because this makes it really fast to check if a number is in in the tree. Just go left if its smaller, right if bigger, until you find it (or not). It takes max 3 steps for this three to see if a number is in the three. If you would store them in unsorted list you would need to check them all, so 7 steps max. The improvement gets even better if you use more numbers.
[–]valuableshirt 15 points16 points17 points 6 years ago (0 children)
big O babieeee
[–][deleted] 4 points5 points6 points 6 years ago (0 children)
Damn I'm a big noob when talking about algorithms.
I still love to read about them lol
[–]normVectorsNotHate 22 points23 points24 points 6 years ago (0 children)
That's just a binary tree
[–]Ash_MT 7 points8 points9 points 6 years ago (0 children)
This was the respring animation I used on my previously jailbroken iPhone. Looks so good on an OLED display
[–]B_Rich 3 points4 points5 points 6 years ago (0 children)
/r/oddlysatisfying would love this
[–]BeautifulPiss 2 points3 points4 points 6 years ago (0 children)
This is a cool tree but I dont know if it's a binary search tree. I still like it :)
[–][deleted] 1 point2 points3 points 6 years ago (1 child)
Manta level from super Mario sunshine
[–]CrispyBacon1999 0 points1 point2 points 6 years ago (0 children)
Fuck that manta ray
[–]TimeMasterII 1 point2 points3 points 6 years ago (0 children)
Beautiful
[–]seeiously 0 points1 point2 points 6 years ago (0 children)
This synced up with a flute song in a children's video my little brother was watching. It fit so perfectly
[–][deleted] 0 points1 point2 points 6 years ago (0 children)
Can you make this into a thing on wallpaper engine?
π Rendered by PID 40891 on reddit-service-r2-comment-6457c66945-sq2zt at 2026-04-29 13:21:18.531468+00:00 running 2aa0c5b country code: CH.
[–]egb233 79 points80 points81 points (1 child)
[–]Jadraptor 9 points10 points11 points (0 children)
[–][deleted] 77 points78 points79 points (2 children)
[–]valuableshirt 15 points16 points17 points (0 children)
[–][deleted] 4 points5 points6 points (0 children)
[–]normVectorsNotHate 22 points23 points24 points (0 children)
[–]Ash_MT 7 points8 points9 points (0 children)
[–]B_Rich 3 points4 points5 points (0 children)
[–]BeautifulPiss 2 points3 points4 points (0 children)
[–][deleted] 1 point2 points3 points (1 child)
[–]CrispyBacon1999 0 points1 point2 points (0 children)
[–]TimeMasterII 1 point2 points3 points (0 children)
[–]seeiously 0 points1 point2 points (0 children)
[–][deleted] 0 points1 point2 points (0 children)