{"id":515,"date":"2021-07-13T17:58:10","date_gmt":"2021-07-13T17:58:10","guid":{"rendered":"https:\/\/www.wikitechy.com\/interview-questions\/?p=515"},"modified":"2021-09-13T06:13:34","modified_gmt":"2021-09-13T06:13:34","slug":"what-is-binary-search-tree","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/","title":{"rendered":"What is Binary Search Tree ?"},"content":{"rendered":"<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"what-is-binary-search-tree\" class=\"color-pink\" style=\"text-align: justify;\">What is binary search tree ?<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>The\u00a0<a href=\"https:\/\/www.wikitechy.com\/technology\/category\/data-structures\/binary-search-tree\/\" target=\"_blank\" rel=\"noopener\">Binary search tree<\/a>\u00a0is a node-based on the binary tree data structure has the following properties,\n<ul>\n<li>The left-side sub tree of a node contains only nodes with keys lesser than the node\u2019s key.<\/li>\n<li>The right-side sub tree of a node contains only nodes with keys greater than the node\u2019s key.<\/li>\n<li>The left-side and right-side subtree each must also be a binary search tree.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"ImageContent\" style=\"text-align: justify;\">\n<div class=\"hddn\"><img decoding=\"async\" class=\"img-responsive center-block aligncenter\" src=\"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif\" alt=\"Binary Search Tree\" \/><\/div>\n<\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"binary-search-tree-traversing\" class=\"color-green\">Binary Search Tree Traversing<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li><a href=\"https:\/\/www.wikitechy.com\/technology\/c-programming-tree-traversals-inorder-preorder-postorder\/\" target=\"_blank\" rel=\"noopener\">Pre-order<\/a>\u00a0traversal.<\/li>\n<li><a href=\"https:\/\/www.wikitechy.com\/technology\/java-programming-tree-traversals-inorder-preorder-postorder\/\" target=\"_blank\" rel=\"noopener\">Post-order<\/a>\u00a0traversal.<\/li>\n<li><a href=\"https:\/\/www.wikitechy.com\/technology\/python-programming-tree-traversals-inorder-preorder-postorder\/\" target=\"_blank\" rel=\"noopener\">In-order<\/a>\u00a0traversal.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"pre-order-traversal\" class=\"color-purple\">Pre-order traversal<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>This traversal technique it may be traversal order is root-left-right.\n<ul>\n<li>Visit the node.<\/li>\n<li>Call itself to traverse the node\u2019s left subtree.<\/li>\n<li>Call itself to traverse the node\u2019s right subtree.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"algoithm\" class=\"color-green\" style=\"text-align: justify;\">Algoithm<\/h2>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <\/div> <pre class=\"language-markdown code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-markdown code-embed-code\">preOrder (t)<br\/>     {<br\/>       if (t is not empty)<br\/>        {<br\/>              access the root element of t;<br\/>              preOrder (leftTree (t));<br\/>              preOrder (rightTree (t));<br\/>       } \/\/ if<br\/>    } \/\/ preOrder traversal<\/code><\/pre> <\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"post-order-traversal\" class=\"color-purple\">Post-order traversal<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>This traversal technique the traversal order is left-right-root.\n<ul>\n<li>Call itself to traverse the node\u2019s left subtree.<\/li>\n<li>Call itself to traverse the node\u2019s right subtree.<\/li>\n<li>Visit the node.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"algoithm-2\" class=\"color-green\" style=\"text-align: justify;\">Algoithm<\/h2>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <\/div> <pre class=\"language-markdown code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-markdown code-embed-code\">postOrder (t)<br\/> { <br\/>   if (t is not empty) <br\/>    { <br\/>       postOrder(leftTree(t));<br\/>       postOrder(rightTree(t)); <br\/>       access the root element of t;<br\/>    } \/\/ if <br\/>} \/\/ postOrder traversal<\/code><\/pre> <\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"n-order-traversal\" class=\"color-purple\">n-order traversal<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>An\u00a0<a href=\"https:\/\/www.wikitechy.com\/technology\/python-programming-inorder-predecessor-successor-given-key-bst\/\" target=\"_blank\" rel=\"noopener\">in-order<\/a>\u00a0traversal of a binary search tree will cause all the nodes to be visited in ascending order, based on their key values. If you want to create a sorted list of the data in a binary tree, this is one way to do it.\n<ul>\n<li>Call itself to traverse the node\u2019s left subtree.<\/li>\n<li>Visit the node.<\/li>\n<li>Call itself to traverse the node\u2019s right subtree<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"algoithm-3\" class=\"color-green\" style=\"text-align: justify;\">Algoithm<\/h2>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <\/div> <pre class=\"language-markdown code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-markdown code-embed-code\">private void inOrder(node localRoot) <br\/>{ <br\/>  if(localRoot != null) <br\/>   {<br\/>      inOrder(localRoot.leftChild);<br\/>      localRoot.displayNode(); <br\/>      inOrder(localRoot.rightChild); <br\/>   }<br\/> }<\/code><\/pre> <\/div>\n<p style=\"text-align: justify;\"><img decoding=\"async\" class=\"img-responsive center-block aligncenter\" src=\"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/binary-tree-traversing.png\" alt=\"Binary Tree Traversing\" \/><\/p>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"advantages\" class=\"color-blue\">Advantages<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>Binary Search Tree is fast in insertion and deletion etc when balanced.<\/li>\n<li>It is very efficient and its code is easier than Linklists.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"disadvantages\" class=\"color-blue\">Disadvantages<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\">\n<div class=\"hddn\">\n<ul>\n<li style=\"text-align: justify;\">The main disadvantage is that we should always implement a balanced binary search tree \u2013 AVL tree, Red-Black tree, Splay tree. Otherwise the cost of operations may not be logarithmic and degenerate into a linear search on an array.<\/li>\n<li style=\"text-align: justify;\">Shape of the tree depends upon order of insertion and it can be degenerated.<\/li>\n<li style=\"text-align: justify;\">Searching takes long time.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Answer : The Binary search tree is a node-based on the binary tree data structure&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3028],"tags":[195,3683,971,491,3705,221,3699,3701,3700,3698,3702,3704,3697,3686,3665,3669,3676,3674,3664,3671,3672,3456,3666,3689,3687,3667,3688,3670,3684,3677,3668,3598,3444,3690,3679,3710,368,203,199,214,198,363,3057,3682,3709,3678,3673,3675,205,3708,222,484,3054,196,212,207,366,3707,204,15929,3706,3685,206,972,200,3055,3681,3680,197,3711,3703,3692,3694,3693,3691,3695,3696,968,3056,285,969],"class_list":["post-515","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-allevel-order-traversal","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-applied-materials-interview-questions-and-answers","tag-balanced-binary-search-tree","tag-bharti-airtel-interview-questions-and-answers","tag-binary-numbers-list","tag-binary-search","tag-binary-search-algorithm","tag-binary-search-code","tag-binary-search-in-data-structure","tag-binary-search-program","tag-binary-search-python","tag-binary-search-tree-algorithm","tag-binary-search-tree-c","tag-binary-search-tree-definition","tag-binary-search-tree-delete-iterative","tag-binary-search-tree-delete-node-c","tag-binary-search-tree-deletion","tag-binary-search-tree-deletion-algorithm-in-c","tag-binary-search-tree-deletion-in-c","tag-binary-search-tree-example","tag-binary-search-tree-insertion","tag-binary-search-tree-insertion-and-deletion-program-in-c","tag-binary-search-tree-java","tag-binary-search-tree-program-in-c","tag-binary-search-tree-program-in-c-using-linked-list","tag-binary-search-tree-python","tag-binary-search-tree-python-library","tag-binary-search-tree-recursive-delete-c","tag-binary-search-tree-traversal","tag-binary-search-tree-traversal-inorder-preorder-postorder-example","tag-binary-tree","tag-binary-tree-program-in-data-structure","tag-binary-tree-traversal-program-in-cinorder-traversal-iterativebinary-tree-traversal-program-in-c","tag-binary-tree-vs-binary-search-tree","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-te-interview-questions-and-answers","tag-construct-binary-tree-from-inorder-and-postorder-travers","tag-delete-node-from-binary-search-tree","tag-deletion-by-merging-in-binary-search-tree","tag-deletion-in-binary-search-tree-examples","tag-deletion-in-binary-search-tree-in-c-program","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-difference-between-binary-tree-and-binary-search-tree","tag-flipkart-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-optimal-binary-search-tree","tag-oracle-corporation-interview-questions-and-answers","tag-polaris-financial-technology-interview-questions-and-answers","tag-recursive-binary-search","tag-recursive-binary-search-tree-python","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-tree-traversal-examples","tag-tree-traversal-questions","tag-unitedhealth-group-interview-questions-and-answers","tag-validate-binary-search-tree","tag-what-is-binary","tag-what-is-binary-search","tag-what-is-binary-search-algorithm","tag-what-is-binary-search-in-data-structure","tag-what-is-binary-search-tree","tag-what-is-binary-search-tree-in-data-structure","tag-what-is-optimal-binary-search-tree","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.6 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>What is Binary Search Tree ? - Data Structure - Wikitechy<\/title>\n<meta name=\"description\" content=\"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"What is Binary Search Tree ? - Data Structure - Wikitechy\" \/>\n<meta property=\"og:description\" content=\"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/\" \/>\n<meta property=\"og:site_name\" content=\"Wikitechy\" \/>\n<meta property=\"article:published_time\" content=\"2021-07-13T17:58:10+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-09-13T06:13:34+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif\" \/>\n<meta name=\"author\" content=\"Editor\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Editor\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/\"},\"author\":{\"name\":\"Editor\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\"},\"headline\":\"What is Binary Search Tree ?\",\"datePublished\":\"2021-07-13T17:58:10+00:00\",\"dateModified\":\"2021-09-13T06:13:34+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/\"},\"wordCount\":443,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree.gif\",\"keywords\":[\"Accenture interview questions and answers\",\"allevel order traversal\",\"Altimetrik India Pvt Ltd interview questions and answers\",\"Applied Materials interview questions and answers\",\"balanced binary search tree\",\"Bharti Airtel interview questions and answers\",\"binary numbers list\",\"binary search\",\"binary search algorithm\",\"binary search code\",\"binary search in data structure\",\"binary search program\",\"binary search python\",\"binary search tree algorithm\",\"binary search tree c++\",\"binary search tree definition\",\"binary search tree delete iterative\",\"binary search tree delete node c++\",\"binary search tree deletion\",\"binary search tree deletion algorithm in c\",\"binary search tree deletion in c\",\"binary search tree example\",\"binary search tree insertion\",\"binary search tree insertion and deletion program in c\",\"binary search tree java\",\"binary search tree program in c\",\"binary search tree program in c++ using linked list\",\"binary search tree python\",\"binary search tree python library\",\"binary search tree recursive delete c++\",\"binary search tree traversal\",\"binary search tree traversal inorder preorder postorder example\",\"binary tree\",\"binary tree program in data structure\",\"binary tree traversal program in cinorder traversal iterativebinary tree traversal program in c++\",\"binary tree vs binary search tree\",\"BMC Software interview questions and answers\",\"Capgemini interview questions and answers\",\"CASTING NETWORKS INDIA PVT LIMITED interview questions and answers\",\"CGI Group Inc interview questions and answers\",\"Chetu interview questions and answers\",\"Ciena Corporation interview questions and answers\",\"Collabera Te interview questions and answers\",\"construct binary tree from inorder and postorder travers\",\"delete node from binary search tree\",\"deletion by merging in binary search tree\",\"deletion in binary search tree examples\",\"deletion in binary search tree in c++ program\",\"Dell International Services India Pvt Ltd interview questions and answers\",\"difference between binary tree and binary search tree\",\"Flipkart interview questions and answers\",\"Genpact interview questions and answers\",\"Globallogic India Pvt Ltd interview questions and answers\",\"IBM interview questions and answers\",\"Indecomm Global Services interview questions and answers\",\"Mphasis interview questions and answers\",\"NetApp interview questions and answers\",\"optimal binary search tree\",\"Oracle Corporation interview questions and answers\",\"polaris financial technology interview questions and answers\",\"recursive binary search\",\"recursive binary search tree python\",\"SAP Labs India Pvt Ltd interview questions and answers\",\"Sapient Consulting Pvt Ltd interview questions and answers\",\"Tech Mahindra interview questions and answers\",\"Tracxn Technologies Pvt Ltd interview questions and answers\",\"tree traversal examples\",\"tree traversal questions\",\"UnitedHealth Group interview questions and answers\",\"validate binary search tree\",\"what is binary\",\"what is binary search\",\"what is binary search algorithm\",\"what is binary search in data structure\",\"what is binary search tree\",\"what is binary search tree in data structure\",\"what is optimal binary search tree\",\"Wipro Infotech interview questions and answers\",\"WM Global Technology Services India Pvt.Ltd Limited (WMGTS) interview questions and answers\",\"Xoriant Solutions Pvt Ltd interview questions and answers\",\"Yodlee Infotech Pvt Ltd interview questions and answers\"],\"articleSection\":[\"Data Structure\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/\",\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/\",\"name\":\"What is Binary Search Tree ? - Data Structure - Wikitechy\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree.gif\",\"datePublished\":\"2021-07-13T17:58:10+00:00\",\"dateModified\":\"2021-09-13T06:13:34+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\"},\"description\":\"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree\\\/#primaryimage\",\"url\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree.gif\",\"contentUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/what-is-binary-search-tree.gif\"},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#website\",\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/\",\"name\":\"Wikitechy\",\"description\":\"Interview Questions\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\",\"name\":\"Editor\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"caption\":\"Editor\"},\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/author\\\/editor\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"What is Binary Search Tree ? - Data Structure - Wikitechy","description":"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties","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:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/","og_locale":"en_US","og_type":"article","og_title":"What is Binary Search Tree ? - Data Structure - Wikitechy","og_description":"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties","og_url":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/","og_site_name":"Wikitechy","article_published_time":"2021-07-13T17:58:10+00:00","article_modified_time":"2021-09-13T06:13:34+00:00","og_image":[{"url":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif","type":"","width":"","height":""}],"author":"Editor","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Editor","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#article","isPartOf":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/"},"author":{"name":"Editor","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757"},"headline":"What is Binary Search Tree ?","datePublished":"2021-07-13T17:58:10+00:00","dateModified":"2021-09-13T06:13:34+00:00","mainEntityOfPage":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/"},"wordCount":443,"commentCount":0,"image":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#primaryimage"},"thumbnailUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif","keywords":["Accenture interview questions and answers","allevel order traversal","Altimetrik India Pvt Ltd interview questions and answers","Applied Materials interview questions and answers","balanced binary search tree","Bharti Airtel interview questions and answers","binary numbers list","binary search","binary search algorithm","binary search code","binary search in data structure","binary search program","binary search python","binary search tree algorithm","binary search tree c++","binary search tree definition","binary search tree delete iterative","binary search tree delete node c++","binary search tree deletion","binary search tree deletion algorithm in c","binary search tree deletion in c","binary search tree example","binary search tree insertion","binary search tree insertion and deletion program in c","binary search tree java","binary search tree program in c","binary search tree program in c++ using linked list","binary search tree python","binary search tree python library","binary search tree recursive delete c++","binary search tree traversal","binary search tree traversal inorder preorder postorder example","binary tree","binary tree program in data structure","binary tree traversal program in cinorder traversal iterativebinary tree traversal program in c++","binary tree vs binary search tree","BMC Software interview questions and answers","Capgemini interview questions and answers","CASTING NETWORKS INDIA PVT LIMITED interview questions and answers","CGI Group Inc interview questions and answers","Chetu interview questions and answers","Ciena Corporation interview questions and answers","Collabera Te interview questions and answers","construct binary tree from inorder and postorder travers","delete node from binary search tree","deletion by merging in binary search tree","deletion in binary search tree examples","deletion in binary search tree in c++ program","Dell International Services India Pvt Ltd interview questions and answers","difference between binary tree and binary search tree","Flipkart interview questions and answers","Genpact interview questions and answers","Globallogic India Pvt Ltd interview questions and answers","IBM interview questions and answers","Indecomm Global Services interview questions and answers","Mphasis interview questions and answers","NetApp interview questions and answers","optimal binary search tree","Oracle Corporation interview questions and answers","polaris financial technology interview questions and answers","recursive binary search","recursive binary search tree python","SAP Labs India Pvt Ltd interview questions and answers","Sapient Consulting Pvt Ltd interview questions and answers","Tech Mahindra interview questions and answers","Tracxn Technologies Pvt Ltd interview questions and answers","tree traversal examples","tree traversal questions","UnitedHealth Group interview questions and answers","validate binary search tree","what is binary","what is binary search","what is binary search algorithm","what is binary search in data structure","what is binary search tree","what is binary search tree in data structure","what is optimal binary search tree","Wipro Infotech interview questions and answers","WM Global Technology Services India Pvt.Ltd Limited (WMGTS) interview questions and answers","Xoriant Solutions Pvt Ltd interview questions and answers","Yodlee Infotech Pvt Ltd interview questions and answers"],"articleSection":["Data Structure"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/","url":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/","name":"What is Binary Search Tree ? - Data Structure - Wikitechy","isPartOf":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#primaryimage"},"image":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#primaryimage"},"thumbnailUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif","datePublished":"2021-07-13T17:58:10+00:00","dateModified":"2021-09-13T06:13:34+00:00","author":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757"},"description":"What is Binary Search Tree ? - Data Structure - The Binary search tree is a node-based on the binary tree data structure has the following properties","inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree\/#primaryimage","url":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif","contentUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/what-is-binary-search-tree.gif"},{"@type":"WebSite","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website","url":"https:\/\/www.wikitechy.com\/interview-questions\/","name":"Wikitechy","description":"Interview Questions","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wikitechy.com\/interview-questions\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757","name":"Editor","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","caption":"Editor"},"url":"https:\/\/www.wikitechy.com\/interview-questions\/author\/editor\/"}]}},"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/515","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/comments?post=515"}],"version-history":[{"count":3,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/515\/revisions"}],"predecessor-version":[{"id":3485,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/515\/revisions\/3485"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/media?parent=515"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/categories?post=515"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/tags?post=515"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}