0
測試二叉樹我要測試的這款Prolog程序:如何在序言
#binary_tree(void).
binary_tree(tree(_Element,Left,Right)):-binary_tree(Left),binary_tree(Right).
test(tree(a,tree(b,tree(d,void,void),void),tree(c,void,void))).
#
當我執行它:
test(X), binary_tree(X).
我得到
X = tree(a, tree(b, tree(d, void, void), void), tree(c, void, void)).
(我應該變成「真」)
我在做什麼錯?
感謝
@IsabelleNewbie是對的 – CapelliC