{"id":384,"date":"2015-11-25T00:25:42","date_gmt":"2015-11-24T21:25:42","guid":{"rendered":"http:\/\/java.mazurok.com\/?page_id=384"},"modified":"2015-12-14T11:27:28","modified_gmt":"2015-12-14T08:27:28","slug":"bst","status":"publish","type":"page","link":"https:\/\/java.mazurok.com\/?page_id=384","title":{"rendered":"BST &#8212; \u0414\u0432\u043e\u0438\u0447\u043d\u044b\u0435 \u0434\u0435\u0440\u0435\u0432\u044c\u044f \u043f\u043e\u0438\u0441\u043a\u0430"},"content":{"rendered":"<p><strong>\u041e\u0446\u0435\u043d\u0438\u0432\u0430\u043d\u0438\u0435: \u0441\u0442\u0430\u043d\u0434\u0430\u0440\u0442\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430, 20 \u0431\u0430\u043b\u043b\u043e\u0432.<\/strong><\/p>\n<p>\u0412\u043e\u0442 \u0437\u0430\u0433\u043e\u0442\u043e\u0432\u043a\u0430 \u0434\u043b\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u0438 \u043a\u043b\u0430\u0441\u0441\u0430 BST \u043d\u0430 \u044f\u0437\u044b\u043a\u0435 Java (\u043e\u0441\u043d\u043e\u0432\u0430\u043d\u0430 \u043d\u0430 \u0442\u0438\u043f\u0435 BST \u0438\u0437 \u043a\u0443\u0440\u0441\u0430 \u0421\u0435\u0434\u0436\u0432\u0438\u043a\u0430 Algorithms, Part I):<\/p>\n<pre class=\"lang:java decode:true \" title=\"BST Class\" >class BST &lt;Key extends Comparable&lt;Key&gt;, Value&gt; {\r\n\t\r\n\tprivate class Node {\r\n\t\tKey key;\r\n\t\tValue value;\r\n\t\tNode left, right;\r\n\t\tpublic Node (Key key, Value value) {\r\n\t\t\tthis.key = key;\r\n\t\t\tthis.value = value;\r\n\t\t\tthis.left = this.right = null;\r\n\t\t}\r\n\t}\r\n\t\r\n\tprivate Node root;\r\n\t\r\n\tprivate Node add (Node node,Key key, Value value){\r\n\t\t\/\/\u0432\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u0438\u0437\u043c\u0435\u043d\u0435\u043d\u043d\u044b\u0439 \u0443\u0437\u0435\u043b (\u043f\u043e\u0441\u043b\u0435 \u0434\u043e\u0431\u0430\u0432\u043b\u0435\u043d\u0438\u044f \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u044f)\r\n\t\tif (node == null)\r\n\t\t{\r\n\t\t\tNode newnode = new Node(key,value);\r\n\t\t\treturn newnode;\r\n\t\t}\r\n\t\tint compareResult = key.compareTo(node.key);\r\n\t\t\/\/...\r\n\t}\r\n\t\r\n\tpublic void add(Key key, Value value) {\r\n\t\troot = add(root, key, value);\r\n\t}\r\n\t\r\n\tpublic void delete(Key key) {\r\n\t\t\/\/...\r\n\t}\r\n\t\r\n\tpublic Value get(Key key) {\r\n\t\t\/\/...\r\n\t}\r\n\t\r\n\tprivate void print(Node node, int level) {\r\n\t\tif (node != null) {\r\n\t\t\tprint(node.right,level+1);\r\n\t\t\tfor (int i=0;i&lt;level;i++) {\r\n\t\t\t\tSystem.out.print(\"\\t\");\r\n\t\t\t}\r\n\t\t\tSystem.out.println(node.key + \"-&gt;\" + node.value); \r\n\t\t\tprint(node.left,level+1);\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic void print() {\r\n\t\tprint(root,0);\r\n\t}\r\n\t\r\n\t\/\/also maxKey, minKey,\r\n\t\r\n}<\/pre>\n<p>\u0421\u043f\u0435\u0446\u0438\u0430\u043b\u0438\u0437\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u0430\u044f \u0432\u0435\u0440\u0441\u0438\u044f \u0434\u043b\u044f \u043f\u043e\u0434\u0441\u0447\u0435\u0442\u0430 \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u0430 \u043a\u043b\u044e\u0447\u0435\u0439 (\u043f\u0440\u0438 \u0434\u043e\u0431\u0430\u0432\u043b\u0435\u043d\u0438\u0438 \u043a\u043b\u044e\u0447\u0430 \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435 \u0443\u0432\u0435\u043b\u0438\u0447\u0438\u0432\u0430\u0435\u0442\u0441\u044f \u043d\u0430 1).<\/p>\n<pre class=\"lang:java decode:true \" title=\"\u041c\u043e\u0434\u0438\u0444\u0438\u0446\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u0430\u044f  \u0432\u0435\u0440\u0441\u0438\u044f\" >class CountingBST &lt;Key extends Comparable&lt;Key&gt;&gt; {\r\n\t\r\n\tprivate class Node {\r\n\t\tKey key;\r\n\t\tint value;\r\n\t\tNode left, right;\r\n\t\tpublic Node (Key key) {\r\n\t\t\tthis.key = key;\r\n\t\t\tthis.value = 1;\r\n\t\t\tthis.left = this.right = null;\r\n\t\t}\r\n\t}\r\n\t\r\n\tprivate Node root;\r\n\t\r\n\tprivate Node add (Node node,Key key){\r\n\t\t\/\/\u0432\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u0438\u0437\u043c\u0435\u043d\u0435\u043d\u043d\u044b\u0439 \u0443\u0437\u0435\u043b (\u043f\u043e\u0441\u043b\u0435 \u0434\u043e\u0431\u0430\u0432\u043b\u0435\u043d\u0438\u044f \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u044f)\r\n\t\tif (node == null)\r\n\t\t{\r\n\t\t\tNode newnode = new Node(key);\r\n\t\t\treturn newnode;\r\n\t\t}\r\n\t\tint compareResult = key.compareTo(node.key);\r\n\t\t\/\/...\r\n\r\n\t}\r\n\t\r\n\tpublic void add(Key key) {\r\n\t\troot = add(root, key);\r\n\t}\r\n\t\r\n\tpublic void delete(Key key) {\r\n\t\t\/\/...\r\n\t}\r\n\t\r\n\tpublic int get(Key key) {\r\n\t\t\/\/...\r\n\t}\r\n\t\r\n\tprivate void print(Node node, int level) {\r\n\t\tif (node != null) {\r\n\t\t\tprint(node.right,level+1);\r\n\t\t\tfor (int i=0;i&lt;level;i++) {\r\n\t\t\t\tSystem.out.print(\"\\t\");\r\n\t\t\t}\r\n\t\t\tSystem.out.println(node.key + \"-&gt;\" + node.value); \r\n\t\t\tprint(node.left,level+1);\r\n\t\t}\r\n\t}\r\n\t\r\n\tpublic void print() {\r\n\t\tprint(root,0);\r\n\t}\r\n\t\r\n\t\/\/also maxKey, minKey,\r\n\t\r\n}<\/pre>\n<p>\u0420\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u0432\u0441\u0435\u0445 \u043e\u0441\u043d\u043e\u0432\u043d\u044b\u0445 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0439 \u043d\u0430\u0434 \u0434\u0432\u043e\u0438\u0447\u043d\u044b\u043c \u0434\u0435\u0440\u0435\u0432\u043e\u043c \u043f\u043e\u0438\u0441\u043a\u0430 (\u0432 \u0432\u0438\u0434\u0435 \u043f\u0441\u0435\u0432\u0434\u043e\u043a\u043e\u0434\u0430), \u043f\u0440\u0438\u0432\u0435\u0434\u0435\u043d\u0430 <a href=\"http:\/\/neerc.ifmo.ru\/wiki\/index.php?title=%D0%94%D0%B5%D1%80%D0%B5%D0%B2%D0%BE_%D0%BF%D0%BE%D0%B8%D1%81%D0%BA%D0%B0,_%D0%BD%D0%B0%D0%B8%D0%B2%D0%BD%D0%B0%D1%8F_%D1%80%D0%B5%D0%B0%D0%BB%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F\">\u0437\u0434\u0435\u0441\u044c<\/a>.<\/p>\n<p>\u0414\u043e\u043f\u043e\u043b\u043d\u0438\u0442\u0435\u043b\u044c\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430: \u0441\u0440\u0430\u0432\u043d\u0438\u0442\u044c \u043f\u0440\u043e\u0438\u0437\u0432\u043e\u0434\u0438\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c \u043f\u043e\u043b\u0443\u0447\u0435\u043d\u043d\u043e\u0433\u043e \u0434\u0432\u043e\u0438\u0447\u043d\u043e\u0433\u043e \u0434\u0435\u0440\u0435\u0432\u0430 \u0432 \u043a\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u0438 \u0430\u0441\u0441\u043e\u0446\u0438\u0430\u0442\u0438\u0432\u043d\u043e\u0433\u043e \u043c\u0430\u0441\u0441\u0438\u0432\u0430 \u0434\u043b\u044f \u0437\u0430\u0434\u0430\u0447\u0438 \u043f\u043e\u0441\u0442\u0440\u043e\u0435\u043d\u0438\u044f \u0447\u0430\u0441\u0442\u043e\u0442\u043d\u043e\u0433\u043e \u0441\u043b\u043e\u0432\u0430\u0440\u044f \u0441 \u043f\u0440\u043e\u0438\u0437\u0432\u043e\u0434\u0438\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c\u044e TreeMap \u0438 HashMap.<br \/>\n<strong>\u041e\u0446\u0435\u043d\u0438\u0432\u0430\u043d\u0438\u0435: \u0441\u0442\u0430\u043d\u0434\u0430\u0440\u0442\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430, 20 \u0431\u0430\u043b\u043b\u043e\u0432.<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u041e\u0446\u0435\u043d\u0438\u0432\u0430\u043d\u0438\u0435: \u0441\u0442\u0430\u043d\u0434\u0430\u0440\u0442\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430, 20 \u0431\u0430\u043b\u043b\u043e\u0432. \u0412\u043e\u0442 \u0437\u0430\u0433\u043e\u0442\u043e\u0432\u043a\u0430 \u0434\u043b\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u0438 \u043a\u043b\u0430\u0441\u0441\u0430 BST \u043d\u0430 \u044f\u0437\u044b\u043a\u0435 Java (\u043e\u0441\u043d\u043e\u0432\u0430\u043d\u0430 \u043d\u0430 \u0442\u0438\u043f\u0435 BST \u0438\u0437 \u043a\u0443\u0440\u0441\u0430 \u0421\u0435\u0434\u0436\u0432\u0438\u043a\u0430 Algorithms, Part I): class BST &lt;Key extends Comparable&lt;Key&gt;, Value&gt; { private class Node { Key key; Value value; Node left, right; public Node (Key key, Value value) { this.key = key; this.value = value; &hellip; <a href=\"https:\/\/java.mazurok.com\/?page_id=384\" class=\"more-link\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":10,"featured_media":0,"parent":246,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/pages\/384"}],"collection":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=384"}],"version-history":[{"count":6,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/pages\/384\/revisions"}],"predecessor-version":[{"id":462,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/pages\/384\/revisions\/462"}],"up":[{"embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/pages\/246"}],"wp:attachment":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=384"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}