Breaking News: Grepper is joining You.com. Read the official announcement!

insertion a bst

Add Answer

Zealous Zebra answered on March 13, 2021 Popularity 8/10 Helpfulness 1/10

answer insertion a bst

related insertion in binary tree

related Insertion in a Binary Tree in level order

related Insertion in a binary search tree

insertion a bst

Comment

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if(root==null)
        {
            TreeNode node = new TreeNode(val);
            return node;

        }
        else if( val< root.val)
        {
            root.left=insertIntoBST(root.left,val);
        }
        else if( val> root.val)
        {
            root.right=insertIntoBST(root.right,val);
        }
        return root;
        
    }
}

Popularity 8/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: insertion java

Link to this answer
Share Copy Link

Contributed on Jun 22 2023

Zealous Zebra

0 Answers Avg Quality 2/10

Closely Related Answers

insertion in binary tree

Comment

# Python program to insert element in binary tree 
class newNode(): 

	def __init__(self, data): 
		self.key = data
		self.left = None
		self.right = None
		
""" Inorder traversal of a binary tree"""
def inorder(temp):

	if (not temp):
		return

	inorder(temp.left) 
	print(temp.key,end = " ")
	inorder(temp.right) 


"""function to insert element in binary tree """
def insert(temp,key):

	if not temp:
		root = newNode(key)
		return
	q = [] 
	q.append(temp) 

	# Do level order traversal until we find 
	# an empty place. 
	while (len(q)): 
		temp = q[0] 
		q.pop(0) 

		if (not temp.left):
			temp.left = newNode(key) 
			break
		else:
			q.append(temp.left) 

		if (not temp.right):
			temp.right = newNode(key) 
			break
		else:
			q.append(temp.right) 
	
# Driver code 
if __name__ == '__main__':
	root = newNode(10) 
	root.left = newNode(11) 
	root.left.left = newNode(7) 
	root.right = newNode(9) 
	root.right.left = newNode(15) 
	root.right.right = newNode(8) 

	print("Inorder traversal before insertion:", end = " ")
	inorder(root) 

	key = 12
	insert(root, key) 

	print() 
	print("Inorder traversal after insertion:", end = " ")
	inorder(root)

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Mar 13 2021

sree_007

0 Answers Avg Quality 2/10

Insertion in a Binary Tree in level order

Comment

# Python program to insert element in binary tree
class newNode():
 
    def __init__(self, data):
        self.key = data
        self.left = None
        self.right = None
         
""" Inorder traversal of a binary tree"""
def inorder(temp):
 
    if (not temp):
        return
 
    inorder(temp.left)
    print(temp.key,end = " ")
    inorder(temp.right)
 
 
"""function to insert element in binary tree """
def insert(temp,key):
 
    if not temp:
        root = newNode(key)
        return
    q = []
    q.append(temp)
 
    # Do level order traversal until we find
    # an empty place.
    while (len(q)):
        temp = q[0]
        q.pop(0)
 
        if (not temp.left):
            temp.left = newNode(key)
            break
        else:
            q.append(temp.left)
 
        if (not temp.right):
            temp.right = newNode(key)
            break
        else:
            q.append(temp.right)
     
# Driver code
if __name__ == '__main__':
    root = newNode(10)
    root.left = newNode(11)
    root.left.left = newNode(7)
    root.right = newNode(9)
    root.right.left = newNode(15)
    root.right.right = newNode(8)
 
    print("Inorder traversal before insertion:", end = " ")
    inorder(root)
 
    key = 12
    insert(root, key)
 
    print()
    print("Inorder traversal after insertion:", end = " ")
    inorder(root)
 
# This code is contributed by DarkDevilor

Popularity 9/10 Helpfulness 1/10 Language python

Source: www.geeksforgeeks.org

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Oct 22 2022

DarkDevilor

0 Answers Avg Quality 2/10

Insertion in a binary search tree

Comment

from binarytree import Node

def insert(T, val):
    parent = search(T, val)
    if val == parent.val: #the value exists in the tree
       return #do nothing
    newnode = Node(val)
    if val < parent.value: #the value is less than the parent
        parent.left = newnode 
    else:  #the value is greater than the parent
        parent.right = newnode

Popularity 6/10 Helpfulness 1/10 Language whatever

Source: www.pynerds.com

Tags: binary-search-tree insertion i

Link to this answer
Share Copy Link

Contributed on Mar 08 2024

John Main

0 Answers Avg Quality 2/10

insertion a bst

Contents

More Related Answers

insertion a bst

Closely Related Answers

insertion in binary tree

Insertion in a Binary Tree in level order

Insertion in a binary search tree

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.