#search
Read more stories on Hashnode
Articles with this tag
In the last post, we have seen how we can create a knowledge base and run queries on it. Today we will try to understand how Prolog computes the...
Level-order traversal · Welcome back to the second part of the "Binary tree traversal" task from Rosetta Code. This is a follow up to part 1. We have...
Pre-order, post-order, in-order · In the last post, we discussed how binary trees are created in PicoLisp. Now let's play a little more with them. See...
"The best time to plant a tree was 25 years ago. The second-best time to plant a tree is today." (Eliud Kipchoge) · In this post, we will talk about a...
