{"id":135970,"date":"2024-05-31T10:52:12","date_gmt":"2024-05-31T05:22:12","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135970"},"modified":"2024-05-31T10:52:12","modified_gmt":"2024-05-31T05:22:12","slug":"bst-traversal-inorder-preorder-and-postorder-in-dsa-java","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/","title":{"rendered":"BST Traversal Inorder, Preorder and Postorder in DSA Java"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/ Program for Binary Search Tree without collection classes\r\nimport java.util.*;\r\nclass BinaryTree\r\n{\r\n        static class Node\r\n        {\r\n            Node ladd;\r\n            int data;\r\n            Node radd;\r\n        }\r\n        Node root=null,new1;\r\n        void create(Node r,Node new1)\r\n        {\r\n            if(new1.data&lt;r.data)      \r\n            {\r\n                 if(r.ladd==null)\r\n                  r.ladd=new1;\r\n                 else\r\n                  create(r.ladd,new1);\r\n            }\r\n            if(new1.data&gt;r.data)      \r\n            {\r\n                 if(r.radd==null)\r\n                  r.radd=new1;\r\n                 else\r\n                  create(r.radd,new1);\r\n            }\r\n             if(new1.data==r.data)      \r\n               System.out.println(\"duplicate elements not allowed\");\r\n\r\n        }\r\n        void inorder(Node pt)\r\n        {\r\n                if(pt!=null)\r\n                {\r\n                    inorder(pt.ladd);   \/\/left move\r\n                    System.out.println(pt.data);  \/\/node data \r\n                    inorder(pt.radd); \/\/right move\r\n                }\r\n        }\r\n        void preorder(Node pt)\r\n        {\r\n            if(pt!=null)\r\n            {\r\n                System.out.println(pt.data);  \/\/node data\r\n                preorder(pt.ladd);  \/\/ left move\r\n                preorder(pt.radd);  \/\/right move\r\n            }\r\n        }\r\n        void postorder(Node pt)\r\n        {\r\n            if(pt!=null)\r\n            {\r\n                postorder(pt.ladd);  \/\/left move\r\n                postorder(pt.radd);   \/\/right move\r\n                System.out.println(pt.data);  \/\/data \r\n            }\r\n        }\r\n        void search(Node pt,int s)\r\n        {\r\n              try\r\n\r\n             {\r\n                 if(pt.data==s)     \r\n                   System.out.println(\"Searching success\");\r\n                 else\r\n                 if(s&lt;pt.data)    \r\n                  search(pt.ladd,s);\r\n                if(s&gt;pt.data)      \r\n                  search(pt.radd,s);\r\n                if(pt==null)  \r\n                System.out.println(\"Searching not success\");\r\n             }\r\n             catch(Exception e)   \r\n             {\r\n                System.out.println(\"Searching not success\");\r\n             }\r\n        }\r\n        void menuDesign()\r\n        {\r\n              int choice,n,s;\r\n              String ch;\r\n              Scanner scan=new Scanner(System.in);\r\n            do\r\n            {  \r\n              System.out.println(\"------------------Binary Tree Search------------------------\");\r\n              System.out.println(\"         1.Create\");\r\n              System.out.println(\"         2.Inorder\");\r\n              System.out.println(\"         3.Preorder\");\r\n              System.out.println(\"         4.Postorder\");\r\n              System.out.println(\"         5.Search\");\r\n              System.out.println(\"         6.Exit\");\r\n              System.out.println(\"-----------------------------------------------------------------\");\r\n              System.out.println(\"Enter your choice\");\r\n              choice=scan.nextInt();\r\n              switch(choice)\r\n              {\r\n                case 1:\r\n                 {\r\n                    do\r\n                    {\r\n                       System.out.println(\"Enter an element\");\r\n                       n=scan.nextInt();\r\n                       new1=new Node();\r\n                       new1.ladd=null;\r\n                       new1.data=n;\r\n                       new1.radd=null;\r\n                       if(root==null)\r\n                       root=new1;\r\n                       else\r\n                       create(root,new1);\r\n                       System.out.println(\"Want to continue\");\r\n                       ch=scan.next();\r\n                    }while(ch.equals(\"y\"));\r\n                    break;\r\n                 }\r\n                case 2:inorder(root);break;\r\n                case 3:preorder(root);break;\r\n                case 4:postorder(root);break;\r\n                case 5:\r\n                    {\r\n                            System.out.println(\"Enter an element for search\");\r\n                            s=scan.nextInt();\r\n                            search(root,s);\r\n                            break;\r\n                    }\r\n                case 6:break;\r\n                default:System.out.println(\"Invalid choice\");\r\n              }\r\n            }while(choice !=6);\r\n\r\n        }\r\n}\r\nclass BinarySearchTree\r\n{\r\n    public static void main(String args[])\r\n    {\r\n            BinaryTree B=new BinaryTree();\r\n            B.menuDesign();\r\n    }\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/ Program for Binary Search Tree without collection classes import java.util.*; class BinaryTree { static class Node { Node ladd; int data; Node radd; } Node root=null,new1; void create(Node r,Node new1) {&#46;&#46;&#46;<\/p>\n","protected":false},"author":86671,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31451],"tags":[32312,32309,32290,32294,32293,32313],"class_list":["post-135970","post","type-post","status-publish","format-standard","hentry","category-dsa-java-tutorials","tag-binary-search-tree-traversing","tag-data-structures-with-java","tag-dsa-using-java","tag-dsa-using-java-practical","tag-dsa-using-java-program","tag-inorder-preorder-postorder-traversing-in-dsa-java"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.8 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>BST Traversal Inorder, Preorder and Postorder in DSA Java - DataFlair<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"BST Traversal Inorder, Preorder and Postorder in DSA Java - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Program for Binary Search Tree without collection classes import java.util.*; class BinaryTree { static class Node { Node ladd; int data; Node radd; } Node root=null,new1; void create(Node r,Node new1) {&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-05-31T05:22:12+00:00\" \/>\n<meta name=\"author\" content=\"TechVidvan Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"TechVidvan Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"BST Traversal Inorder, Preorder and Postorder in DSA Java - DataFlair","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/","og_locale":"en_US","og_type":"article","og_title":"BST Traversal Inorder, Preorder and Postorder in DSA Java - DataFlair","og_description":"Program 1 \/\/ Program for Binary Search Tree without collection classes import java.util.*; class BinaryTree { static class Node { Node ladd; int data; Node radd; } Node root=null,new1; void create(Node r,Node new1) {&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-31T05:22:12+00:00","author":"TechVidvan Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"TechVidvan Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"BST Traversal Inorder, Preorder and Postorder in DSA Java","datePublished":"2024-05-31T05:22:12+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/"},"wordCount":11,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["binary search tree traversing","data structures with java","dsa using java","dsa using java practical","dsa using java program","inorder preorder postorder traversing in dsa java"],"articleSection":["DSA using Java Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/","url":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/","name":"BST Traversal Inorder, Preorder and Postorder in DSA Java - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-31T05:22:12+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/bst-traversal-inorder-preorder-and-postorder-in-dsa-java\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using Java Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-java-tutorials\/"},{"@type":"ListItem","position":3,"name":"BST Traversal Inorder, Preorder and Postorder in DSA Java"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49","name":"TechVidvan Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","caption":"TechVidvan Team"},"description":"TechVidvan Team provides high-quality content &amp; courses on AI, ML, Data Science, Data Engineering, Data Analytics, programming, Python, DSA, Android, Flutter, full stack web dev, MERN, and many latest technology.","url":"https:\/\/data-flair.training\/blogs\/author\/test001\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135970","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/86671"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=135970"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135970\/revisions"}],"predecessor-version":[{"id":142603,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135970\/revisions\/142603"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135970"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135970"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135970"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}