Binary Search Tree

by tammasr

JavaScript

// pseudocode:

//Adding a node
1. if node is null
			return add node
   else 
   		// recursive function 
   		const searchTree = function (node) {
      	if node.data < element
        	if node.left === null
          	add node
            return;
          else node.left !== null
        		return searchTree(node.left)	
        elseif node.data > element
        	if node.right === null
          	add node
            return;
          else node.right !== null
        		return searchTree(node.right)	
        else 
        	return null
     
      }
      searchTree(node)
    
 //FindMin
 While loop to check null & do current = curren.left
 //Find Max
  While loop to check null & do current = curren.right
  
 //is Present