Question: Complete the Prolog program below that processes a binary tree replacing all keys in nodes with a value of 0 with a value of 1.
Complete the Prolog program below that processes a binary tree replacing all keys in nodes with a value of 0 with a value of 1.
zeroNodes(nil,_______________________) :- !. zeroNodes(t(0,L,R),________________________) :- zeroNodes(L,___________________), zeroNodes(R,___________________), !. zeroNodes(t(Key,L,R),________________________) :- zeroNodes(L,___________________), zeroNodes(R,___________________).
Examples:
?- zeroNodes(t(0,nil,nil),T). T = t(1, nil, nil). ?- zeroNodes(t(0,t(3,nil,t(0,nil,nil)),t(3,nil,nil)),T). T = t(1, t(3, nil, t(1, nil, nil)), t(3, nil, nil)).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
