Algoithm<\/h2>\n

<\/div>

private void inOrder(node localRoot) {   if(localRoot != null)    {      inOrder(localRoot.leftChild);      localRoot.displayNode();       inOrder(localRoot.rightChild);    } }<\/code><\/pre> <\/div>\n
<\/p>\n
\n
\n
Advantages<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
Binary Search Tree is fast in insertion and deletion etc when balanced.<\/li>\n
It is very efficient and its code is easier than Linklists.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
\n
\n
Disadvantages<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
The main disadvantage is that we should always implement a balanced binary search tree – 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
Shape of the tree depends upon order of insertion and it can be degenerated.<\/li>\n
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":"
Answer : The Binary search tree is a node-based on the binary tree data structure…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"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":"\n