static Node Insert(Node root,int value) {
if(root==null) { Node node=new Node(); node.data=value; node.left=null; node.right=null; root=node; } else if(root.data>value) root.left=Insert(root.left,value); else if(root.data<value) root.right=Insert(root.right,value); return root; }
Recursive:
def insertion(self, cur, val): if not cur: cur = Node(val) elif cur.info > val: cur.left = self.insertion(cur.left, val) else: cur.right = self.insertion(cur.right, val) return cur def insert(self, val): if not self.root: self.root = Node(val) else: self.insertion(self.root, val)
Iterative:
def insert(self, val): cur = self.root if not cur: self.root = Node(val) return self.root while cur: if cur.info > val: if cur.left: cur = cur.left else: cur.left = Node(val) break else: if cur.right: cur = cur.right else: cur.right = Node(val) break return self.root
Iterative Python solution:
def insert(self, val): if self.root == None: self.root = Node(val) root = self.root while True: if val > root.info: if root.right: root = root.right else: root.right = Node(val) break elif val < root.info: if root.left: root = root.left else: root.left = Node(val) break else: break
node * insert(node * root, int value) { if (root == NULL) { root = (node *)malloc(sizeof(node)); root->data = value; return root; } if (value < root->data) { root->left = insert(root->left, value); } else { root->right = insert(root->right, value); } return root; }My solution
Simple 4 line recursive solution:
if(root == null) return new Node(data); if(data<root.data) root.left = insert(root.left, data); else if(data>root.data) root.right = insert(root.right, data); return root;
Load more conversations
Sort 516 Discussions, By:
Please Login in order to post a comment