{"entities":{"Q1111397":{"pageid":1122146,"ns":120,"title":"Item:Q1111397","lastrevid":66688734,"modified":"2026-04-12T11:59:40Z","type":"item","id":"Q1111397","labels":{"en":{"language":"en","value":"Two algorithms for constructing a binary tree from its traversals"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4076652"}},"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":"Q1111397$521567F6-7C3B-4DBD-9791-AD846BE803BE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"75550ce46c9eca488a48776e50b8ba3a3e92a7c1","datavalue":{"value":{"text":"Two algorithms for constructing a binary tree from its traversals","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1111397$6D7295B4-2BBE-4B87-85C9-E2E01EEE33B9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0e49cd231935713c41a379dab27b541c16a4773d","datavalue":{"value":"0658.68084","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$EA86D65C-4E9E-403C-8799-B624159B9725","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a9e8ce11e6ae174b2664bb1311e3e4fb889ea163","datavalue":{"value":"10.1016/0020-0190(88)90177-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$802F52E7-C41E-497E-AD4A-BBB88174E2E6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"aedf720352fcca932fab3523c4bbcafd7c4c7cdb","datavalue":{"value":{"entity-type":"item","numeric-id":1104176,"id":"Q1104176"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111397$B3A6A63E-2361-4D1B-81F5-A4F3971BE6CD","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111397$4FD55F12-8507-4030-B0D6-34F5186EBB86","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-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":"Q1111397$FF368536-F576-4F53-A1B4-308064E7FB3F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1705e6a6ffbbc0d2c38b429e4008e58ad138a187","datavalue":{"value":"Given the inorder traversal of a binary tree, along with one of its preorder or postorder traversals, the original binary tree can be uniquely identified. We present two construction algorithms: one, which requires O(N) time, is time optimal but space inefficient, and the other requires O(N log N) time and O(N) space.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111397$DF0ADBDC-9DB9-4A8B-9862-63F78F569C36","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$8AB56677-51FA-42C4-9405-D28B7E6FD426","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$048521F2-63AB-42D0-BF82-644DFDB2BD6F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c82926546de470b960e67180dfdedafbf276c56a","datavalue":{"value":"4076652","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$7CEEEC53-4A3E-4407-B277-4520D8DCA944","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c25bc710e4a99b4ad5c06b7d722ebbdb9259ca1e","datavalue":{"value":"data structure","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111397$E58D0013-51D9-4DF3-80D0-87C756CB8F34","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"882eb54c2b2470fe48263e9f9d634336ac692531","datavalue":{"value":"tree traversal","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111397$61AEBDF3-2BA2-44C5-9878-325A7A19FBBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e7bcb48c25db0908929ba2383247380f87f15321","datavalue":{"value":"binary tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111397$0A11DD2B-1A41-4850-B44D-63AA1B843871","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":"Q1111397$500BC8E4-1ECE-416B-8422-D2E0D605982D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a98dc01d03e483c3b2969b5a3d80b6c02d495c75","datavalue":{"value":"https://doi.org/10.1016/0020-0190(88)90177-9","type":"string"},"datatype":"url"},"type":"statement","id":"Q1111397$1E083BDE-25E1-4443-AE3E-295EDBC487CB","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"ff0d9e27cd9da04fb4a9c40481112a0039fc782c","datavalue":{"value":"W1998478920","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111397$F85B372A-DC6C-44F8-99D1-8FB2A4E41E3B","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"a81ec583a2959caca2dcdf7cee1ecdda2046af4d","datavalue":{"value":{"entity-type":"item","numeric-id":1055196,"id":"Q1055196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111397$42F7224B-1726-4778-B859-37FA87454ADD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d7853bf93dd63a7668077029ec9cea40df9361a0","datavalue":{"value":{"entity-type":"item","numeric-id":4114762,"id":"Q4114762"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111397$DA8074B3-73AB-432C-B965-518B29FB8523","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc6482fda869c7df0ed32fd6ade8f790a1ff04cc","datavalue":{"value":{"entity-type":"item","numeric-id":5585020,"id":"Q5585020"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111397$1B6C2D04-84A3-4756-A1BE-DE3729526647","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"63346e120b8d70d4ed8a7591fb1be3803e568cf8","datavalue":{"value":{"entity-type":"item","numeric-id":1198039,"id":"Q1198039"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4fddd6f54df6d62d41e101dae78b8c73677257da","datavalue":{"value":{"amount":"+0.9050278067588806","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111397$6778DD07-E8F5-4609-9A6A-04A7010CE977","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"18b1bdea7b0d013ea9f2dc296045b2ae7bd3029f","datavalue":{"value":{"entity-type":"item","numeric-id":4511613,"id":"Q4511613"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8dd2f0a2352fdc9f7409add354f2b0979fec7530","datavalue":{"value":{"amount":"+0.9010685682296752","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111397$A0098F72-5480-4CD5-B08A-E466577418BD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6c1590fa3bd2bfbec3d35f0c16838a11a35ca913","datavalue":{"value":{"entity-type":"item","numeric-id":2277867,"id":"Q2277867"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"321ae2644694190c0cbe064dca5b1149b5d025a7","datavalue":{"value":{"amount":"+0.8977695107460022","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111397$B40D2CB3-9746-4A0B-9758-BD67C6AB527B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a2256ffa2e811f5fa3f1f7cb8b9092e696c472f2","datavalue":{"value":{"entity-type":"item","numeric-id":910183,"id":"Q910183"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e9274c97929152456b547859dcec4734a83e1ea1","datavalue":{"value":{"amount":"+0.8430513143539429","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111397$CD57BE4D-7B39-4D6A-8827-14B79FB372AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f37da9bd30beddc76412eb45f4df1c15a5814696","datavalue":{"value":{"entity-type":"item","numeric-id":1198037,"id":"Q1198037"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d0fd96302b7df8149b901288bd5b4c866e3c1a6f","datavalue":{"value":{"amount":"+0.8272421956062317","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1111397$E25B3411-7513-4B8C-BF28-9C00BD098DA5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Two algorithms for constructing a binary tree from its traversals","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Two_algorithms_for_constructing_a_binary_tree_from_its_traversals"}}}}}