Skip to content

TreeTraversal added #1058

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed

ram123-debug wants to merge 9 commits into TheAlgorithms:master from ram123-debug:master

Closed

TreeTraversal added #1058

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

TreeTraversal added

ram123-debug Jul 16, 2022

Update TreeTraversal.js

ram123-debug Jul 16, 2022

Updated TreeTraversal

ram123-debug Jul 16, 2022

Standard --fix is done

ram123-debug Jul 16, 2022

ram123-debug Jul 16, 2022

ram123-debug Jul 16, 2022

ram123-debug Jul 16, 2022

ram123-debug Jul 16, 2022

ram123-debug Jul 22, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

30 changes: 30 additions & 0 deletions Data-Structures/Tree/TreeTraversal.js

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,30 @@
	// O(n) Time and O(n) Space Complexity

	function inOrderTraverse (tree, array) {
	if (tree !== null) {
	inOrderTraverse(tree.left, array)
	array.push(tree.value)
	inOrderTraverse(tree.right, array)
	}
	return array
	}

	function preOrderTraverse (tree, array) {
ram123-debug marked this conversation as resolved. Show resolved Hide resolved ram123-debug marked this conversation as resolved. Show resolved Hide resolved
	if (tree !== null) {
	array.push(tree.value)
	preOrderTraverse(tree.left, array)
	preOrderTraverse(tree.right, array)
	}
	return array
	}

	function postOrderTraverse (tree, array) {
ram123-debug marked this conversation as resolved. Show resolved Hide resolved
	if (tree !== null) {
	postOrderTraverse(tree.left, array)
	postOrderTraverse(tree.right, array)
	array.push(tree.value)
	}
	return array
	}

	export { inOrderTraverse, preOrderTraverse, postOrderTraverse }