{"entities":{"Q3919096":{"pageid":5949001,"ns":120,"title":"Item:Q3919096","lastrevid":92930504,"modified":"2026-06-05T03:09:31Z","type":"item","id":"Q3919096","labels":{"en":{"language":"en","value":"Generalized non-recursive traversal of binary trees"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3731355"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3919096$C0B795FF-367F-432C-8724-E1910CA1A7F3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b16e34ca79f933f2aac592877ea398b2f750f8e3","datavalue":{"value":{"text":"Generalized non-recursive traversal of binary trees","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3919096$B2399588-1210-4919-A34B-F416D6AA32E6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7f9bd12711eb4debda630756805782b83ca4b0cb","datavalue":{"value":"0466.68054","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3919096$4E864DE7-A27D-4FDB-B575-07AC6E84D9FA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d553fbc1e5da629501718b62be86238e5fa8e43","datavalue":{"value":{"entity-type":"item","numeric-id":3919095,"id":"Q3919095"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3919096$88DDDD92-E4F7-4911-9FC5-D8FBC7A3E58C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6bbb50f7f5b3cd8a52a9219fdf89800968ce21d0","datavalue":{"value":{"entity-type":"item","numeric-id":111603,"id":"Q111603"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3919096$4679B995-C1DA-42C3-A067-FA4D3E86BA69","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q3919096$6372F48B-6F21-4F02-BB72-2EAEA611BBF1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3919096$54CB3F86-15A2-4066-A45D-B863810B7598","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3952cd00ab53c78dcb757d5a511aa4d4c66ed77e","datavalue":{"value":"3731355","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3919096$B6418200-9719-465B-90D4-5F1BEF145E50","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d362543607b4dbb7f500c2e89c9a2087c9d7336","datavalue":{"value":"non-recursive algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q3919096$83096147-E1CD-4CCA-B280-C11BC109DDB9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"882eb54c2b2470fe48263e9f9d634336ac692531","datavalue":{"value":"tree traversal","type":"string"},"datatype":"string"},"type":"statement","id":"Q3919096$41019206-6A72-44A6-91B8-3671B60DE5B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"19f35830334a25e58f55047ba05b17e3f54f65e8","datavalue":{"value":"recursion elimination","type":"string"},"datatype":"string"},"type":"statement","id":"Q3919096$EDACECA5-03A9-4FE4-806A-8344DD353A59","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3919096$35BA06B5-7D08-4905-A790-1E6E82AB2EAC","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"31ea60405d1fd822d64244790ec5991fe5af90a6","datavalue":{"value":"https://doi.org/10.1002/spe.4380111207","type":"string"},"datatype":"url"},"type":"statement","id":"Q3919096$3025A0FA-A8BA-4CC3-AA6D-1EDF44AA4365","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"46626538f4f03ead38a69ade968c5b0b83489ca7","datavalue":{"value":"W2012461315","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3919096$BD5E1F7F-1DC4-4455-A524-A6978DA2B0E3","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0233f4a88635a4047cdb77724fa187605e0edda0","datavalue":{"value":"10.1002/SPE.4380111207","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3919096$C933E3B0-E64E-42AD-8613-CACF57AF3A7D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Generalized non-recursive traversal of binary trees","badges":[]}}}}}