Commit 1eb8a3c

author

Manjunath

committed

code arrangement

1 parent bdebccb commit 1eb8a3cCopy full SHA for 1eb8a3c

File tree

+37

-3

lines changed

+37

-3

lines changed

Lines changed: 9 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,14 +33,14 @@ let tree = new Node(1);`
`33`	`33`	`tree.leftNode = new Node(2);`
`34`	`34`	`tree.rightNode = new Node(3);`
`35`	`35`
`36`		`-// level -3`
	`36`	`+// level -3`
`37`	`37`	`tree.leftNode.leftNode = new Node(4);`
`38`	`38`	`tree.leftNode.rightNode = new Node(5);`
`39`	`39`
`40`	`40`	`tree.rightNode.leftNode = new Node(6);`
`41`	`41`	`tree.rightNode.rightNode = new Node(7);`
`42`	`42`
`43`		`-// level -4`
	`43`	`+// level -4`
`44`	`44`	`tree.leftNode.leftNode.leftNode = new Node(8);`
`45`	`45`	`tree.leftNode.leftNode.rightNode = new Node(9);`
`46`	`46`
`@@ -52,5 +52,12 @@ tree.rightNode.leftNode.rightNode = new Node(13);`
`52`	`52`
`53`	`53`	`tree.rightNode.rightNode.leftNode = new Node(14);`
`54`	`54`	`tree.rightNode.rightNode.rightNode = new Node(15);`
	`55`	`+// 1`
	`56`	`+// / \`
	`57`	`+// 2 3`
	`58`	`+// / \ / \`
	`59`	`+// 4 5 6 7`
	`60`	`+// / \ / \ / \ / \`
	`61`	`+// 8 9 10 11 12 13 14 15`
`55`	`62`	`levelOrderTraversalLineByLine(tree);`
`56`	`63`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -53,5 +53,12 @@ tree.rightNode.leftNode.rightNode = new Node(13);`
`53`	`53`
`54`	`54`	`tree.rightNode.rightNode.leftNode = new Node(14);`
`55`	`55`	`tree.rightNode.rightNode.rightNode = new Node(15);`
	`56`	`+// 1`
	`57`	`+// / \`
	`58`	`+// 2 3`
	`59`	`+// / \ / \`
	`60`	`+// 4 5 6 7`
	`61`	`+// / \ / \ / \ / \`
	`62`	`+// 8 9 10 11 12 13 14 15`
`56`	`63`	`levelOrderTraversal(tree);`
`57`	`64`

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -68,5 +68,11 @@ tree.rightNode.leftNode.rightNode = new Node(13);`
`68`	`68`
`69`	`69`	`tree.rightNode.rightNode.leftNode = new Node(14);`
`70`	`70`	`tree.rightNode.rightNode.rightNode = new Node(15);`
`71`		`-`
	`71`	`+// 1`
	`72`	`+// / \`
	`73`	`+// 2 3`
	`74`	`+// / \ / \`
	`75`	`+// 4 5 6 7`
	`76`	`+// / \ / \ / \ / \`
	`77`	`+// 8 9 10 11 12 13 14 15`
`72`	`78`	`levelOrderTraversalWithDirection(tree);`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -52,4 +52,11 @@ tree.rightNode.leftNode.rightNode = new Node(13);`
`52`	`52`
`53`	`53`	`tree.rightNode.rightNode.leftNode = new Node(14);`
`54`	`54`	`tree.rightNode.rightNode.rightNode = new Node(15);`
	`55`	`+// 1`
	`56`	`+// / \`
	`57`	`+// 2 3`
	`58`	`+// / \ / \`
	`59`	`+// 4 5 6 7`
	`60`	`+// / \ / \ / \ / \`
	`61`	`+// 8 9 10 11 12 13 14 15`
`55`	`62`	`levelOrderTraversalInSpiral(tree);`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -63,4 +63,11 @@ tree.rightNode.leftNode.rightNode = new Node(13);`
`63`	`63`
`64`	`64`	`tree.rightNode.rightNode.leftNode = new Node(14);`
`65`	`65`	`tree.rightNode.rightNode.rightNode = new Node(15);`
	`66`	`+// 1`
	`67`	`+// / \`
	`68`	`+// 2 3`
	`69`	`+// / \ / \`
	`70`	`+// 4 5 6 7`
	`71`	`+// / \ / \ / \ / \`
	`72`	`+// 8 9 10 11 12 13 14 15`
`66`	`73`	`reverseLevelOrderTraversal(tree);`

Comments

(0)