Try focusing on this set of problems: P-99: Ninety-Nine Prolog Problems. If you get stuck, feel free to check GitHub for solutions, and you’re welcome to contribute.
ouerghi01
ouerghi01
Anyone interested, try solving this problem: Construct a complete binary tree. You can find the problem statement in the link, under problem number 63 in the repository. It’s a great way to learn about binary search trees (BST).
1
