Commit249b37d

authored

Merge pull requestneetcode-gh#3000 from dkiryanov/csharp/0701-insert-into-a-binary-search-tree

Added a C# solution to 701. Insert into a Binary Search Tree

2 parents2b8eaa1 +fa47c47 commit249b37dCopy full SHA for 249b37d

File tree

+51

-0

lines changed

+51

-0

lines changed

Lines changed: 51 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,51 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * public class TreeNode {`
	`4`	`+ * public int val;`
	`5`	`+ * public TreeNode left;`
	`6`	`+ * public TreeNode right;`
	`7`	`+ * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {`
	`8`	`+ * this.val = val;`
	`9`	`+ * this.left = left;`
	`10`	`+ * this.right = right;`
	`11`	`+ * }`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+publicclassSolution`
	`15`	`+{`
	`16`	`+publicTreeNodeInsertIntoBST(TreeNoderoot,intval)`
	`17`	`+{`
	`18`	`+if(rootisnull)returnnewTreeNode(val);`
	`19`	`+`
	`20`	`+TreeNodecur=root;`
	`21`	`+`
	`22`	`+while(curis notnull)`
	`23`	`+{`
	`24`	`+if(cur.val<val)`
	`25`	`+{`
	`26`	`+if(cur.rightisnull)`
	`27`	`+{`
	`28`	`+cur.right=newTreeNode(val);`
	`29`	`+break;`
	`30`	`+}`
	`31`	`+`
	`32`	`+cur=cur.right;`
	`33`	`+continue;`
	`34`	`+}`
	`35`	`+`
	`36`	`+if(cur.val>val)`
	`37`	`+{`
	`38`	`+if(cur.leftisnull)`
	`39`	`+{`
	`40`	`+cur.left=newTreeNode(val);`
	`41`	`+break;`
	`42`	`+}`
	`43`	`+`
	`44`	`+cur=cur.left;`
	`45`	`+continue;`
	`46`	`+}`
	`47`	`+}`
	`48`	`+`
	`49`	`+returnroot;`
	`50`	`+}`
	`51`	`+}`

Comments

(0)