The most challenging part in writing a binary tree is to make it efficient. Any node is 1 bit (true/false). But computers can only update 8 bits (1 byte) at the same time. So you need to do some fun bitmasking logic to issue commands to 8 bits at the time, but only change 1 bit.
4:40 AM - 3 Jun 2018
0 replies
2 retweets
5 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.