Skip to content

Commit a148ac1

neilchauhan2 neilchauhan2

authored

Binary Search Tree

1 parent d366232 commit a148ac1Copy full SHA for a148ac1

File tree

1 file changed

+36

-0

lines changed

Algorithms/Tree/Binary Search Tree/Python
- bst.py

1 file changed

+36

-0

lines changed

`‎Algorithms/Tree/Binary Search Tree/Python/bst.py‎`

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+class Node:`
	`2`	`+ def __init__(self,key):`
	`3`	`+ self.left = None`
	`4`	`+ self.right = None`
	`5`	`+ self.val = key`
	`6`	`+`
	`7`	`+ def insert(root,node):`
	`8`	`+ if root is None:`
	`9`	`+ root = node`
	`10`	`+ else:`
	`11`	`+ if root.val < node.val:`
	`12`	`+ if root.right is None:`
	`13`	`+ root.right = node`
	`14`	`+ else:`
	`15`	`+ insert(root.right, node)`
	`16`	`+ else:`
	`17`	`+ if root.left is None:`
	`18`	`+ root.left = node`
	`19`	`+ else:`
	`20`	`+ insert(root.left, node)`
	`21`	`+`
	`22`	`+ def inorder(root):`
	`23`	`+ if root:`
	`24`	`+ inorder(root.left)`
	`25`	`+ print(root.val)`
	`26`	`+ inorder(root.right)`
	`27`	`+`
	`28`	`+ r = Node(37)`
	`29`	`+ insert(r,Node(84))`
	`30`	`+ insert(r,Node(45))`
	`31`	`+ insert(r,Node(63))`
	`32`	`+ insert(r,Node(20))`
	`33`	`+ insert(r,Node(15))`
	`34`	`+ insert(r,Node(8))`
	`35`	`+`
	`36`	`+ inorder(r)`

0 commit comments

Comments

(0)