Binary dictionary


Dictionary lookup in a binary tree

Source: The Art of Prolog


Program source code:


    lookup(Key,Dictionary,Value) :-
	Dictionary contains the value indexed under Key.
	Dictionary is represented as an ordered binary tree.
	lookup(Key,dict(Key,X,Left,Right),Value) :-
		!, X = Value.
	lookup(Key,dict(Key1,X,Left,Right),Value) :-
		Key < Key1 , lookup(Key,Left,Value).
	lookup(Key,dict(Key1,X,Left,Right),Value) :-
		Key > Key1, lookup(Key,Right,Value).
%	Program 15.9: Dictionary lookup in a binary tree


pl/prolog/pllib/binary_dictionary.txt · ostatnio zmienione: 2019/06/27 15:50 (edycja zewnętrzna) Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0