This is quite simple. Just traverse the node from root to left recursively until left is NULL. The node whose left is NULL is the node with minimum value.<\/p>\n
For the above tree, we start with 20, then we move left 8, we keep on moving to left until we see NULL. Since left of 4 is NULL, 4 is the node with minimum value.<\/p>\n[pastacode lang=\u201dc\u201d manual=\u201d%23include%20%3Cstdio.h%3E%0A%23include%3Cstdlib.h%3E%0A%20%0A%2F*%20A%20binary%20tree%20node%20has%20data%2C%20pointer%20to%20left%20child%20%0A%20%20%20and%20a%20pointer%20to%20right%20child%20*%2F%0Astruct%20node%20%0A%7B%0A%20%20%20%20int%20data%3B%0A%20%20%20%20struct%20node*%20left%3B%0A%20%20%20%20struct%20node*%20right%3B%0A%7D%3B%0A%20%0A%2F*%20Helper%20function%20that%20allocates%20a%20new%20node%20%0Awith%20the%20given%20data%20and%20NULL%20left%20and%20right%20%0Apointers.%20*%2F%0Astruct%20node*%20newNode(int%20data)%20%0A%7B%0A%20%20struct%20node*%20node%20%3D%20(struct%20node*)%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20malloc(sizeof(struct%20node))%3B%0A%20%20node-%3Edata%20%20%3D%20data%3B%0A%20%20node-%3Eleft%20%20%3D%20NULL%3B%0A%20%20node-%3Eright%20%3D%20NULL%3B%0A%20%20%20%0A%20%20return(node)%3B%0A%7D%0A%20%0A%2F*%20Give%20a%20binary%20search%20tree%20and%20a%20number%2C%20%0Ainserts%20a%20new%20node%20with%20the%20given%20number%20in%20%0Athe%20correct%20place%20in%20the%20tree.%20Returns%20the%20new%20%0Aroot%20pointer%20which%20the%20caller%20should%20then%20use%20%0A(the%20standard%20trick%20to%20avoid%20using%20reference%20%0Aparameters).%20*%2F%0Astruct%20node*%20insert(struct%20node*%20node%2C%20int%20data)%20%0A%7B%0A%20%20%2F*%201.%20If%20the%20tree%20is%20empty%2C%20return%20a%20new%2C%20%20%20%20%20%0A%20%20%20%20%20%20single%20node%20*%2F%0A%20%20if%20(node%20%3D%3D%20NULL)%20%0A%20%20%20%20return(newNode(data))%3B%20%20%0A%20%20else%0A%20%20%7B%0A%20%20%20%20%2F*%202.%20Otherwise%2C%20recur%20down%20the%20tree%20*%2F%0A%20%20%20%20if%20(data%20%3C%3D%20node-%3Edata)%20%0A%20%20%20%20%20%20%20%20node-%3Eleft%20%20%3D%20insert(node-%3Eleft%2C%20data)%3B%0A%20%20%20%20else%0A%20%20%20%20%20%20%20%20node-%3Eright%20%3D%20insert(node-%3Eright%2C%20data)%3B%0A%20%20%20%0A%20%20%20%20%2F*%20return%20the%20(unchanged)%20node%20pointer%20*%2F%0A%20%20%20%20return%20node%3B%20%0A%20%20%7D%0A%7D%0A%20%0A%2F*%20Given%20a%20non-empty%20binary%20search%20tree%2C%20%20%0Areturn%20the%20minimum%20data%20value%20found%20in%20that%20%0Atree.%20Note%20that%20the%20entire%20tree%20does%20not%20need%20%0Ato%20be%20searched.%20*%2F%0Aint%20minValue(struct%20node*%20node)%20%7B%0A%20%20struct%20node*%20current%20%3D%20node%3B%0A%20%0A%20%20%2F*%20loop%20down%20to%20find%20the%20leftmost%20leaf%20*%2F%0A%20%20while%20(current-%3Eleft%20!%3D%20NULL)%20%7B%0A%20%20%20%20current%20%3D%20current-%3Eleft%3B%0A%20%20%7D%0A%20%20return(current-%3Edata)%3B%0A%7D%0A%20%0A%2F*%20Driver%20program%20to%20test%20sameTree%20function*%2F%20%20%20%0Aint%20main()%0A%7B%0A%20%20struct%20node*%20root%20%3D%20NULL%3B%0A%20%20root%20%3D%20insert(root%2C%204)%3B%0A%20%20insert(root%2C%202)%3B%0A%20%20insert(root%2C%201)%3B%0A%20%20insert(root%2C%203)%3B%0A%20%20insert(root%2C%206)%3B%0A%20%20insert(root%2C%205)%3B%20%20%0A%20%0A%20%20printf(%22%5Cn%20Minimum%20value%20in%20BST%20is%20%25d%22%2C%20minValue(root))%3B%0A%20%20getchar()%3B%0A%20%20return%200%3B%20%20%20%20%0A%7D\u201d message=\u201dC Programming\u201d highlight=\u201d\u201d provider=\u201dmanual\u201d\/]\n
Time Complexity:<\/strong> O(n) Worst case happens for left skewed trees. C Program Find the node with minimum value in a Binary Search Tree-Binary Search Tree-. traverse the node from root to left recursively until left is NULL.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[80126,69866,1],"tags":[80564,80559,80549,80550,80545,80554,80548,80536,80535,80543,70290,80565,80544,80541,70280,80560],"class_list":["post-26968","post","type-post","status-publish","format-standard","hentry","category-binary-search-tree","category-c-programming","category-coding","tag-bst-online","tag-bstree-java","tag-code-for-binary-search-tree-in-c","tag-data-structure-binary-search-tree","tag-define-binary-tree","tag-define-bst","tag-definition-of-binary-search-tree","tag-find-maximum-in-binary-search-treekeyword","tag-find-min-and-max-in-binary-search-tree","tag-how-to-construct-a-binary-tree","tag-java-program-for-binary-search","tag-min-search","tag-properties-of-binary-tree-in-data-structure","tag-root-binary","tag-search-tree","tag-write-an-algorithm-for-binary-search-with-example"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26968","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26968"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26968\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26968"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26968"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26968"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nSimilarly we can get the maximum value by recursively traversing the right node of a binary search tree.<\/p>\n[ad type=\u201dbanner\u201d]\n","protected":false},"excerpt":{"rendered":"