{"id":534,"date":"2015-12-24T01:12:51","date_gmt":"2015-12-23T22:12:51","guid":{"rendered":"http:\/\/java.mazurok.com\/?p=534"},"modified":"2015-12-26T09:34:29","modified_gmt":"2015-12-26T06:34:29","slug":"bst-%d0%b4%d0%b2%d0%be%d0%b8%d1%87%d0%bd%d1%8b%d0%b5-%d0%b4%d0%b5%d1%80%d0%b5%d0%b2%d1%8c%d1%8f-%d0%bf%d0%be%d0%b8%d1%81%d0%ba%d0%b0","status":"publish","type":"post","link":"https:\/\/java.mazurok.com\/?p=534","title":{"rendered":"BST \u2013 \u0414\u0432\u043e\u0438\u0447\u043d\u044b\u0435 \u0434\u0435\u0440\u0435\u0432\u044c\u044f \u043f\u043e\u0438\u0441\u043a\u0430"},"content":{"rendered":"

\u0417\u0430\u0434\u0430\u0447\u0430<\/strong><\/p>\n

\u0420\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u0430\u0442\u044c \u043a\u043b\u0430\u0441\u0441, \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0449\u0438\u0439 \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0441\u0442\u044c \u0434\u0435\u0440\u0435\u0432\u0430 \u0434\u0432\u043e\u0438\u0447\u043d\u043e\u0433\u043e \u043f\u043e\u0438\u0441\u043a\u0430.<\/p>\n

\u0421\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u0443\u0441\u043b\u043e\u0432\u0438\u0435 http:\/\/java.mazurok.com\/word-of-week\/bst<\/a><\/p>\n

\u0422\u0435\u0441\u0442\u044b<\/strong><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
input<\/td>\noutput<\/td>\n<\/tr>\n
put S 11.11<\/td>\nOk<\/td>\n<\/tr>\n
put E 22.22<\/td>\nOk<\/td>\n<\/tr>\n
put A 33.33<\/td>\nOk<\/td>\n<\/tr>\n
put R 44.44<\/td>\nOk<\/td>\n<\/tr>\n
put H 55.55<\/td>\nOk<\/td>\n<\/tr>\n
put C 66.66<\/td>\nOk<\/td>\n<\/tr>\n
put X 77.77<\/td>\nOk<\/td>\n<\/tr>\n
put M 88.88<\/td>\nOk<\/td>\n<\/tr>\n
size<\/td>\n8<\/td>\n<\/tr>\n
min<\/td>\n(A->33.33)\/2<\/td>\n<\/tr>\n
max<\/td>\n(X->77.77)\/1<\/td>\n<\/tr>\n
print<\/td>\nL0: (S->11.11)\/8
\n.L1: (E->22.22)\/6
\n..L2: (A->33.33)\/2
\n…L3: (C->66.66)\/1
\n..L2: (R->44.44)\/3
\n…L3: (H->55.55)\/2
\n….L4: (M->88.88)\/1
\n.L1: (X->77.77)\/1<\/td>\n<\/tr>\n
delete E<\/td>\nOk<\/td>\n<\/tr>\n
size<\/td>\n7<\/td>\n<\/tr>\n
min<\/td>\n(A->33.33)\/2<\/td>\n<\/tr>\n
max<\/td>\n(X->77.77)\/1<\/td>\n<\/tr>\n
print<\/td>\nL0: (S->11.11)\/7
\n.L1: (H->55.55)\/5
\n..L2: (A->33.33)\/2
\n…L3: (C->66.66)\/1
\n..L2: (R->44.44)\/2
\n…L3: (M->88.88)\/1
\n.L1: (X->77.77)\/1<\/td>\n<\/tr>\n
exit<\/td>\nN\/A<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u041a\u0440\u0438\u0442\u0435\u0440\u0438\u0439 \u0442\u0435\u0441\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f<\/strong><\/em><\/p>\n

\u0412 \u0445\u043e\u0434\u0435 \u0442\u0435\u0441\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f \u043c\u044b \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u0435\u043c 8 \u043a\u043b\u044e\u0447\u0435\u0439 \u0441 \u0443\u043d\u0438\u043a\u0430\u043b\u044c\u043d\u044b\u043c\u0438 \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u044f\u043c\u0438. \u0417\u0430\u0442\u0435\u043c \u043c\u044b \u043e\u043f\u0440\u0435\u0434\u0435\u043b\u044f\u0435\u043c \u0440\u0430\u0437\u043c\u0435\u0440, \u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u044b\u0439 \u0438 \u043c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u044b\u0439 \u0443\u0437\u043b\u044b, \u0430 \u0442\u0430\u043a\u0436\u0435 \u0440\u0430\u0441\u043f\u0435\u0447\u0430\u0442\u044b\u0432\u0430\u0435\u043c \u0432\u0441\u0435 \u0434\u0435\u0440\u0435\u0432\u043e, \u0447\u0442\u043e\u0431\u044b \u0443\u0431\u0435\u0434\u0438\u0442\u0441\u044f, \u0447\u0442\u043e \u043e\u043d\u043e \u0438\u043c\u0435\u0435\u0442 \u043e\u0436\u0438\u0434\u0430\u0435\u043c\u043e\u044e \u043a\u043e\u043d\u0444\u0438\u0433\u0443\u0440\u0430\u0446\u0438\u044e. \u0417\u0430\u0442\u0435\u043c \u043c\u044b \u0443\u0434\u0430\u043b\u044f\u0435\u043c 1 \u043a\u043b\u044e\u0447 \u0441 \u0441\u0435\u0440\u0435\u0434\u0438\u043d\u043d\u044b\u043c \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435\u043c \u0438 \u043f\u043e\u0432\u0442\u043e\u0440\u044f\u0435\u043c \u0432\u044b\u0448\u0435\u043f\u0435\u0440\u0435\u0447\u0438\u0441\u043b\u0435\u043d\u043d\u044b\u0435 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438, \u0447\u0442\u043e\u0431\u044b \u0443\u0432\u0438\u0434\u0435\u0442\u044c \u043e\u0436\u0438\u0434\u0430\u0435\u043c\u044b\u0435 \u0438\u0437\u043c\u0435\u043d\u0435\u043d\u0438\u044f \u0432 \u0434\u0435\u0440\u0435\u0432\u0435.<\/p>\n

\u0424\u043e\u0440\u043c\u0430\u0442 \u0432\u044b\u0432\u043e\u0434\u0430:<\/p>\n

\u041a\u043e\u043c\u0430\u043d\u0434\u044b min \u0438 max \u0432\u044b\u0432\u043e\u0434\u044f\u0442 \u043e\u0434\u0438\u043d\u043e\u0447\u043d\u044b\u0439 \u0443\u0437\u0435\u043b \u0432 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u043c \u0444\u043e\u0440\u043c\u0430\u0442\u0435: (\u043a\u043b\u044e\u0447->\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435)\/\u043a\u043e\u043b-\u0432\u043e \u0443\u0437\u043b\u043e\u0432<\/p>\n

\u041a\u043e\u043c\u0430\u043d\u0434\u0430 print \u0432\u044b\u0432\u043e\u0434\u0438\u0442 \u0434\u0435\u0440\u0435\u0432\u043e \u043f\u043e \u0443\u0440\u043e\u0432\u043d\u044f\u043c, \u043a\u0430\u0436\u0434\u0430\u044f \u0441\u0442\u0440\u043e\u0447\u043a\u0430 \u0438\u043c\u0435\u0435\u0442 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0438\u0439 \u0444\u043e\u0440\u043c\u0430\u0442: \u0443\u0440\u043e\u0432\u0435\u043d\u044c: (\u043a\u043b\u044e\u0447->\u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435)\/\u043a\u043e\u043b-\u0432\u043e \u0443\u0437\u043b\u043e\u0432<\/p>\n

\u0421\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u044b<\/strong><\/p>\n

\u041a\u043e\u0434 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u044b \u0441\u043e\u0441\u0442\u043e\u0438\u0442 \u0438\u0437 \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0438\u0445 \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432, \u043e\u0431\u044a\u0435\u0434\u0438\u043d\u0435\u043d\u043d\u044b\u0445 \u0432 \u043f\u0430\u043a\u0435\u0442 odessa.uni.imem.maxim<\/strong><\/em>:<\/p>\n

    \n
  1. \u041a\u043b\u0430\u0441\u0441 CountingBST<\/em><\/strong>, \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0449\u0438\u0439 \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0441\u0442\u044c \u0434\u0435\u0440\u0435\u0432\u0430 \u0434\u0432\u043e\u0438\u0447\u043d\u043e\u0433\u043e \u043f\u043e\u0438\u0441\u043a\u0430 \u0441 \u043f\u043e\u0434\u0441\u0447\u0435\u0442\u043e\u043c \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u0430 \u0443\u0437\u043b\u043e\u0432 \u0432 \u0434\u0435\u0440\u0435\u0432\u0435<\/li>\n
  2. \u041a\u043b\u0430\u0441\u0441 CountingBSTTestApp,<\/strong><\/em> \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0449\u0438\u0439 \u0442\u0435\u0441\u0442\u043e\u0432\u043e\u0435 \u043f\u0440\u0438\u043b\u043e\u0436\u0435\u043d\u0438\u0435<\/li>\n<\/ol>\n

    \u041a\u043b\u0430\u0441\u0441 CountingBST<\/em><\/strong><\/strong><\/em><\/p>\n

    package odessa.uni.imem.maxim;\r\n\r\nclass CountingBST<Key extends Comparable<Key>, Value>\r\n{\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public class Node\r\n   {\r\n      Key key;\r\n      Value value;\r\n      Node left, right;\r\n      int count;\r\n\r\n      public Node( Key key, Value value, int count)\r\n      {\r\n         this.key = key;\r\n         this.value = value;\r\n         this.left = this.right = null;\r\n         this.count = count;\r\n      }\r\n   }\r\n\r\n   private Node root;\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public void put( Key key, Value val )\r\n   {\r\n      root = put( root, key, val );\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   private Node put( Node x, Key key, Value val )\r\n   {\r\n      if (x == null)\r\n         return new Node( key, val, 1 );\r\n      int cmp = key.compareTo( x.key );\r\n      if (cmp < 0)\r\n         x.left = put( x.left, key, val );\r\n      else if (cmp > 0)\r\n         x.right = put( x.right, key, val );\r\n      else if (cmp == 0)\r\n         x.value = val;\r\n      x.count = 1 + size( x.left ) + size( x.right );\r\n      return x;\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public Value get( Key key )\r\n   {\r\n      Node x = root;\r\n      while (x != null)\r\n      {\r\n         int cmp = key.compareTo( x.key );\r\n         if (cmp < 0)\r\n            x = x.left;\r\n         else if (cmp > 0)\r\n            x = x.right;\r\n         else if (cmp == 0)\r\n            return x.value;\r\n      }\r\n      return null;\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public int size()\r\n   {\r\n      return size( root );\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   private int size( Node x )\r\n   {\r\n      if (x == null)\r\n         return 0;\r\n      return x.count;\r\n   }\r\n   \r\n   \/\/ --------------------------------------------------------------------------\r\n   public Node min()\r\n   {\r\n      return min(root);\r\n   }\r\n   \r\n   \/\/ --------------------------------------------------------------------------\r\n   private Node min( Node x )\r\n   {\r\n      if ( x != null )\r\n      {\r\n         if (x.left == null)\r\n         {\r\n            return x;\r\n         }\r\n         return min( x.left );\r\n      }\r\n      return null;\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public Node max()\r\n   {\r\n      return max(root);\r\n   }\r\n   \r\n   \/\/ --------------------------------------------------------------------------\r\n   private Node max( Node x )\r\n   {\r\n      if ( x != null )\r\n      {\r\n         if (x.right == null)\r\n         {\r\n            return x;\r\n         }\r\n         return max( x.right );\r\n      }\r\n      return null;\r\n   }\r\n \r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   private Node deleteMin( Node x )\r\n   {\r\n      if ( x != null )\r\n      {\r\n         if (x.left == null)\r\n            return x.right;\r\n         x.left = deleteMin( x.left );\r\n         x.count = 1 + size(x.left) + size(x.right);\r\n         return x;\r\n      }\r\n      return null;\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public void delete( Key key )\r\n   {\r\n      root = delete( root, key );\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   private Node delete( Node x, Key key )\r\n   {\r\n      if (x == null)\r\n         return null;\r\n      int cmp = key.compareTo( x.key );\r\n      if (cmp < 0)\r\n         x.left = delete( x.left, key );\r\n      else if (cmp > 0)\r\n         x.right = delete( x.right, key );\r\n      else\r\n      {\r\n         if (x.right == null)\r\n            return x.left;\r\n         if (x.left == null)\r\n            return x.right;\r\n         Node t = x;\r\n         x = min( t.right );\r\n         x.right = deleteMin( t.right );\r\n         x.left = t.left;\r\n      }\r\n      x.count = size( x.left ) + size( x.right ) + 1;\r\n      return x;\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   private void print( Node node, int level )\r\n   {\r\n      if (node != null)\r\n      {\r\n         for( int i = 0; i<level; i++ )\r\n         {\r\n            System.out.print( \".\" );\r\n         }\r\n         System.out.printf( \"L%d: (\", level );\r\n         System.out.print( node.key );\r\n         System.out.print( \"->\" );\r\n         System.out.print( node.value );\r\n         System.out.print( \")\" );\r\n         System.out.printf( \"\/%d\", node.count );\r\n         System.out.println();\r\n\r\n         print( node.left, level + 1 );\r\n         print( node.right, level + 1 );\r\n      }\r\n   }\r\n\r\n   \/\/ --------------------------------------------------------------------------\r\n   public void print()\r\n   {\r\n      print( root, 0 );\r\n   }\r\n\r\n   \/\/ also maxKey, minKey,\r\n\r\n}<\/pre>\n
    \u0412\u0441\u0435 \u043c\u0435\u0442\u043e\u0434\u044b \u0440\u0430\u0437\u0434\u0435\u043b\u0435\u043d\u044b \u043d\u0430 \u043f\u0430\u0440\u044b — \u043e\u0434\u0438\u043d \u043c\u0435\u0442\u043e\u0434 \u043f\u0430\u0440\u044b \u043f\u0440\u0438\u0432\u0430\u0442\u043d\u044b\u0439, \u0430 \u0434\u0440\u0443\u0433\u043e\u0439 — \u043f\u0443\u0431\u043b\u0438\u0447\u043d\u044b\u0439. \u042d\u0442\u043e \u043d\u0435\u043e\u0431\u0445\u043e\u0434\u0438\u043c\u043e \u0434\u043b\u044f \u0442\u043e\u0433\u043e, \u0447\u0442\u043e\u0431\u044b \u043f\u0435\u0440\u0435\u0434\u0430\u0432\u0430\u0442\u044c \u043f\u0435\u0440\u0432\u044b\u043c \u0430\u0440\u0433\u0443\u043c\u0435\u043d\u0442\u043e\u043c \u043a\u043e\u0440\u0435\u043d\u044c \u0434\u0435\u0440\u0435\u0432\u0430, \u043d\u0430\u0447\u0438\u043d\u0430\u044f \u0441 \u043a\u043e\u0442\u043e\u0440\u043e\u0433\u043e \u0432\u044b\u043f\u043e\u043b\u043d\u044f\u044e\u0442\u0441\u044f \u0432\u0441\u0435 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438. \u041a\u0430\u0436\u0434\u044b\u0439 \u043f\u0440\u0438\u0432\u0430\u0442\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u0441\u043e\u0434\u0435\u0440\u0436\u0438\u0442 \u043f\u0435\u0440\u0432\u044b\u043c \u0430\u0440\u0433\u0443\u043c\u0435\u043d\u0442\u043e\u043c \u0443\u0437\u0435\u043b, \u043d\u0430\u0447\u0438\u043d\u0430\u044f \u0441 \u043a\u043e\u0442\u043e\u0440\u043e\u0433\u043e \u0431\u0443\u0434\u0435\u0442 \u0432\u044b\u043f\u043e\u043b\u043d\u044f\u0442\u0441\u044f \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u044f. \u041f\u0443\u0431\u043b\u0438\u0447\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u0432\u044b\u0437\u044b\u0432\u0430\u0435\u0442 \u043f\u0440\u0438\u0432\u0430\u0442\u043d\u044b\u0439 \u0438 \u043f\u0435\u0440\u0435\u0434\u0430\u0435\u0442 \u0435\u043c\u0443 \u0432 \u043a\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u043f\u0435\u0440\u0432\u043e\u0433\u043e \u0430\u0440\u0433\u0443\u043c\u0435\u043d\u0442\u0430 \u043a\u043e\u0440\u0435\u043d\u044c \u0434\u0435\u0440\u0435\u0432\u0430. \u042d\u0442\u043e \u043e\u0442\u043d\u043e\u0441\u0438\u0442\u0441\u044f \u043a \u043e\u0441\u043d\u043e\u0432\u043d\u044b\u043c \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u044f\u043c \u043d\u0430 \u0434\u0435\u0440\u0435\u0432\u0435:<\/p>\n
      \n
    1. put — \u043f\u043e\u043c\u0435\u0449\u0430\u0435\u0442 \u043a\u043b\u044e\u0447 \u0438 \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435 \u0432 \u0434\u0435\u0440\u0435\u0432\u043e<\/li>\n
    2. get — \u0438\u0437\u0432\u043b\u0435\u043a\u0430\u0435\u0442 \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435 \u043f\u043e \u043a\u043b\u0447\u0443<\/li>\n
    3. size — \u0432\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0443\u0437\u043b\u043e\u0432 \u0434\u0435\u0440\u0435\u0432\u0430<\/li>\n
    4. min — \u043d\u0430\u0445\u043e\u0434\u0438\u0442 \u0443\u0437\u0435\u043b \u0441 \u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u044b\u043c \u043a\u043b\u044e\u0447\u043e\u043c<\/li>\n
    5. max — \u043d\u0430\u0445\u043e\u0434\u0438\u0442 \u0443\u0437\u0435\u043b \u0441 \u043c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u044b\u043c \u043a\u043b\u044e\u0447\u043e\u043c<\/li>\n
    6. delete — \u0443\u0434\u0430\u043b\u0435\u043d\u0438\u0435 \u043f\u043e \u0425\u0438\u0431\u0431\u0430\u0440\u0434\u0443 ( Coursera presentation )<\/li>\n
    7. print — \u043f\u0435\u0447\u0430\u0442\u044c \u0434\u0435\u0440\u0435\u0432\u0430<\/li>\n<\/ol>\n
      \u041f\u043e\u043c\u0438\u043c\u043e \u043e\u0441\u043d\u043e\u0432\u043d\u044b\u0445 \u043f\u043e\u043b\u0435\u0439, \u043d\u0435\u043e\u0431\u0445\u043e\u0434\u0438\u043c\u044b\u0445 \u0434\u043b\u044f BST, \u0443\u0437\u0435\u043b \u0441\u043e\u0434\u0435\u0440\u0436\u0438\u0442 \u043f\u043e\u043b\u0435 count, \u0432 \u043a\u043e\u0442\u043e\u0440\u043e\u043c \u0441\u043e\u0434\u0435\u0440\u0436\u0438\u0442\u0441\u044f \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0432\u0441\u0435 \u0443\u0437\u043b\u043e\u0432 \u043f\u043e\u0434\u0434\u0435\u0440\u0435\u0432\u0430, \u043a\u043e\u0440\u043d\u0435\u043c \u043a\u043e\u0442\u043e\u0440\u043e\u0433\u043e \u044f\u0432\u043b\u044f\u0435\u0442\u0441\u044f \u0434\u0430\u043d\u043d\u044b\u0439 \u0443\u0437\u0435\u043b, \u0432\u043a\u043b\u044e\u0447\u0430\u044f \u0441\u0430\u043c \u0443\u0437\u0435\u043b.<\/p>\n
      \u041a\u043b\u0430\u0441\u0441 <\/strong><\/em>CountingBSTTestApp<\/strong><\/em><\/p>\n
      package odessa.uni.imem.maxim;\r\n\r\nimport java.util.*;\r\n\r\npublic class CountingBSTTestApp\r\n{\r\n\r\n   \/\/ parse text line into tokens, e.g. \"put salary 120.22\" to \"put\" \"salary\" \"120.22\"\r\n   public static Vector<String> parseTextToTokens( String text )\r\n   {\r\n      Vector<String> tokens = new Vector<String>();\r\n      StringTokenizer st = new StringTokenizer(text);        \r\n      while (st.hasMoreTokens())\r\n      {\r\n         tokens.add(st.nextToken());\r\n      }\r\n      return tokens;\r\n   }\r\n\r\n   \/\/ helper function: converts string to double if possible or returns null\r\n   public static Double strToDouble( String s )\r\n   {\r\n      Double x = null;\r\n      try\r\n      {\r\n         x = Double.parseDouble( s );\r\n      }\r\n      catch( NumberFormatException e )\r\n      {\r\n      }\r\n      return x;\r\n   }\r\n\r\n   \/\/ print content of one node into human readable form\r\n   public static void printTreeNode( CountingBST<String,Double>.Node node )\r\n   {\r\n      if ( node != null )\r\n      {\r\n         System.out.print( \"(\" );\r\n         System.out.print( node.key );\r\n         System.out.print( \"->\" );\r\n         System.out.print( node.value );\r\n         System.out.print( \")\/\" );\r\n         System.out.print( node.count );\r\n         System.out.println();\r\n      }\r\n      else\r\n      {\r\n         System.out.println(\"null\");\r\n      }\r\n   }\r\n   \r\n   \/\/ main method with command line interpreter\r\n   public static void main(String[] args)\r\n   {\r\n      CountingBST<String,Double> tree = new CountingBST<String,Double>(); \r\n      \r\n      Scanner in = new Scanner(System.in);\r\n      \r\n      for(;;)\r\n      {\r\n        String inputLine = in.nextLine();\r\n        if ( inputLine.isEmpty() )\r\n        {\r\n           continue;  \r\n        }\r\n        \r\n        String cmd = null;\r\n        String arg1 = null;\r\n        String arg2 = null;\r\n       \r\n        {\r\n           Vector<String> inputTokens = parseTextToTokens( inputLine );\r\n           if ( inputTokens.size() > 0 ) cmd  = inputTokens.get(0);\r\n           if ( inputTokens.size() > 1 ) arg1 = inputTokens.get(1);\r\n           if ( inputTokens.size() > 2 ) arg2 = inputTokens.get(2);\r\n        }\r\n        \r\n        if ( cmd.equals(\"exit\") )\r\n        {\r\n           break;  \r\n        }\r\n        else\r\n        if ( cmd.equals(\"print\") )\r\n        {\r\n           tree.print();\r\n        }\r\n        else \r\n        if (cmd.equals(\"size\"))\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 System.out.println(tree.size());\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n        else\r\n        if ( cmd.equals(\"put\") )\r\n        {\r\n           String key   = ( arg1 != null && !arg1.isEmpty()) ? arg1 : null ;\r\n           Double value = ( arg2 != null ) ? strToDouble( arg2 ) : null ;\r\n           if ( key == null || value == null )\r\n           {\r\n              System.out.printf(\"*** ERROR: wrong arguments: <%s> <%s> <%s>\\n\",cmd,arg1,arg2);\r\n              continue;\r\n           }\r\n           tree.put( key, value );\r\n           System.out.println(\"Ok\");\r\n        }\r\n        else if ( cmd.equals(\"get\") )\r\n        {\r\n           String key   = ( arg1 != null && !arg1.isEmpty()) ? arg1 : null ;\r\n           if ( key == null )\r\n           {\r\n              System.out.printf(\"*** ERROR: wrong arguments: <%s> <%d>\\n\",cmd,arg1);\r\n              continue;\r\n           }\r\n           Double value = tree.get( key );\r\n           System.out.println(value);\r\n        }\r\n        else if ( cmd.equals(\"delete\") )\r\n        {\r\n           String key   = ( arg1 != null && !arg1.isEmpty()) ? arg1 : null ;\r\n           if ( key == null )\r\n           {\r\n              System.out.printf(\"*** ERROR: wrong arguments: <%s> <%d>\\n\",cmd,arg1);\r\n              continue;\r\n           }\r\n           tree.delete( key );\r\n           System.out.println(\"Ok\");\r\n        }\r\n        else if ( cmd.equals(\"min\") )\r\n        {\r\n           printTreeNode( tree.min() );\r\n        } \r\n        else if ( cmd.equals(\"max\") )\r\n        {\r\n           printTreeNode( tree.max() );\r\n        }\r\n        \r\n      }\r\n      \r\n      in.close();\r\n\r\n  } \r\n   \r\n}\r\n<\/pre>\n
      \u0414\u0430\u043d\u043d\u044b\u0439 \u043a\u043b\u0430\u0441\u0441 \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u0435\u0442 \u0442\u0435\u0441\u0442\u043e\u0432\u043e\u0435 \u043f\u0440\u0438\u043b\u043e\u0436\u0435\u043d\u0438\u0435 \u0434\u043b\u044f \u043a\u043b\u0430\u0441\u0441\u0430 CountingBST<\/strong><\/em>. \u041e\u043d \u0441\u043e\u0434\u0435\u0440\u0436\u0438\u0442 \u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u044b\u0435 \u0444\u0443\u043d\u043a\u0446\u0438\u0438 \u0432\u0432\u043e\u0434\u0430 \u0438 \u0444\u0443\u043d\u043a\u0446\u0438\u044e main, \u0441\u043e\u0434\u0435\u0440\u0436\u0430\u0449\u0443\u044e \u043a\u043e\u0434 \u0442\u0435\u0441\u0442\u0430. \u041e\u043d \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u0435\u0442 \u043a\u043e\u043c\u0430\u043d\u0434\u043d\u044b\u0439 \u0438\u043d\u0442\u0435\u0440\u043f\u0440\u0438\u0442\u0430\u0442\u043e\u0440, \u0433\u0434\u0435 \u043a\u0430\u0436\u0434\u0430\u044f \u043a\u043e\u043c\u0430\u043d\u0434\u0430 \u0432\u044b\u0437\u044b\u0432\u0430\u0435\u0442 \u0441\u043e\u043e\u0442\u0432\u0435\u0442\u0441\u0442\u0432\u0443\u044e\u0449\u0438\u0439 \u043f\u0443\u0431\u043b\u0438\u0447\u043d\u044b\u0439 \u043c\u0435\u0442\u043e\u0434 \u0442\u0435\u0441\u0442\u0438\u0440\u0443\u0435\u043c\u043e\u0433\u043e \u043a\u043b\u0430\u0441\u0441\u0430. \u041f\u043e-\u044d\u0442\u043e\u043c\u0443 \u0442\u0435\u0441\u0442 \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u044f\u0435\u0442 \u0441\u043e\u0431\u043e\u0439 \u0442\u0435\u043a\u0441\u0442\u043e\u0432\u044b\u0439 \u0444\u0430\u0439\u043b \u0441 \u043a\u043e\u043c\u0430\u043d\u0434\u0430\u043c\u0438 \u0434\u043b\u044f \u0441\u0442\u0430\u043d\u0434\u0430\u0440\u0442\u043d\u043e\u0433\u043e \u043f\u043e\u0442\u043e\u043a\u0430 \u0432\u0432\u043e\u0434\u0430 \u0441 \u043a\u043e\u043d\u0441\u043e\u043b\u0438.<\/p>\n
      \u0421\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 Ideone: https:\/\/ideone.com\/b0xrPX<\/a><\/p>\n
       <\/p>\n","protected":false},"excerpt":{"rendered":"
      \u0417\u0430\u0434\u0430\u0447\u0430 \u0420\u0430\u0437\u0440\u0430\u0431\u043e\u0442\u0430\u0442\u044c \u043a\u043b\u0430\u0441\u0441, \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0449\u0438\u0439 \u0444\u0443\u043d\u043a\u0446\u0438\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0441\u0442\u044c \u0434\u0435\u0440\u0435\u0432\u0430 \u0434\u0432\u043e\u0438\u0447\u043d\u043e\u0433\u043e \u043f\u043e\u0438\u0441\u043a\u0430. \u0421\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u0443\u0441\u043b\u043e\u0432\u0438\u0435 http:\/\/java.mazurok.com\/word-of-week\/bst \u0422\u0435\u0441\u0442\u044b input output put S 11.11 Ok put E 22.22 Ok put A 33.33 Ok put R 44.44 Ok put H 55.55 Ok put C 66.66 Ok put X 77.77 Ok put M 88.88 Ok size 8 min (A->33.33)\/2 max (X->77.77)\/1 print L0: … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":41,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[27,49],"tags":[51,52],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/posts\/534"}],"collection":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/users\/41"}],"replies":[{"embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=534"}],"version-history":[{"count":6,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/posts\/534\/revisions"}],"predecessor-version":[{"id":577,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=\/wp\/v2\/posts\/534\/revisions\/577"}],"wp:attachment":[{"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=534"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=534"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/java.mazurok.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=534"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}