Binary Trees/Inorder - Revision history

Admin: /* Notes */

2017-09-07T15:54:08Z

Notes

← Older revision		Revision as of 15:54, 7 September 2017
Line 9:		Line 9:

	<pre>		<pre>

	// public inorder_traversal method:		// public inorder_traversal method:

Line 23:		Line 22:
	visit( position, depth )		visit( position, depth )
	inorder_traversal(tree, position.right(), depth+1 );		inorder_traversal(tree, position.right(), depth+1 );

	</pre>		</pre>

Admin: /* Notes */

2017-09-07T15:53:52Z

Notes

← Older revision		Revision as of 15:53, 7 September 2017
Line 9:		Line 9:

	<pre>		<pre>

			// public inorder_traversal method:

	define inorder_traversal( tree ):		define inorder_traversal( tree ):
	inorder_traversal( tree, root, 0 )		inorder_traversal( tree, root, 0 )


			// protected/private recursive inorder_traversal method:
			// (note, visit() function is the action being performed on the tree node)

	define inorder_traversal( tree, position, depth ):		define inorder_traversal( tree, position, depth ):
	inorder_traversal( tree, position.left(), depth+1 );		inorder_traversal( tree, position.left(), depth+1 );
	~~// perform~~ visit ~~action on~~ position		visit( position, depth )
	inorder_traversal(tree, position.right(), depth+1 );		inorder_traversal(tree, position.right(), depth+1 );

Admin at 15:46, 7 September 2017

2017-09-07T15:46:54Z

← Older revision		Revision as of 15:46, 7 September 2017
Line 21:		Line 21:
	=Related Pages=		=Related Pages=

	~~Preorder, postorder, and in-order traversals on trees:~~		{{TraversalRelated}}
	* [[Trees/Preorder]]
	* [[Binary Trees/Inorder]]
	* [[Trees/Postorder]]

	~~Breadth-first and depth-first traversals on trees:~~
	* [[DFS]]
	* [[BFS]]

	~~Graphs, generalization of tree structures:~~
	* [[Graphs#Graph Traversals]]

	=Flags=		=Flags=

Admin: /* Related Pages */

2017-09-07T12:23:50Z

← Older revision		Revision as of 12:23, 7 September 2017
Line 22:		Line 22:

	Preorder, postorder, and in-order traversals on trees:		Preorder, postorder, and in-order traversals on trees:
			* [[Trees/Preorder]]
	* [[Binary Trees/Inorder]]		* [[Binary Trees/Inorder]]
	* [[Trees/Postorder]]		* [[Trees/Postorder]]

Admin: /* Flags */

2017-09-07T12:23:28Z

Flags

← Older revision		Revision as of 12:23, 7 September 2017
Line 18:		Line 18:

	</pre>		</pre>

			=Related Pages=

			Preorder, postorder, and in-order traversals on trees:
			* [[Binary Trees/Inorder]]
			* [[Trees/Postorder]]

			Breadth-first and depth-first traversals on trees:
			* [[DFS]]
			* [[BFS]]

			Graphs, generalization of tree structures:
			* [[Graphs#Graph Traversals]]

	=Flags=		=Flags=

	{{TreesFlag}}		{{TreesFlag}}
	~~{{AlgorithmsFlag}}~~

	[[Category:Trees]]		[[Category:Trees]]
			[[Category:Binary Trees]]

	[[Category:Traversal]]		[[Category:Traversal]]
	[[Category:~~Binary Trees~~]]		[[Category:Algorithms]]
	[[Category:Recursion]]		[[Category:Recursion]]
	~~[[Category:DFS]]~~

Admin: /* Binary Trees - In-order Traversal */

2017-09-07T12:22:31Z

Binary Trees - In-order Traversal

← Older revision		Revision as of 12:22, 7 September 2017
Line 1:		Line 1:
	=~~Binary Trees - In-order Traversal=~~		=Notes=

	~~==Basic idea=~~=

	The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree, a recursive definition:		The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree, a recursive definition:

Admin: /* Basic idea */

2017-06-11T20:08:38Z

Basic idea

← Older revision		Revision as of 20:08, 11 June 2017
Line 9:		Line 9:
	The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)		The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)


			<pre>
			define inorder_traversal( tree ):
			inorder_traversal( tree, root, 0 )

			define inorder_traversal( tree, position, depth ):
			inorder_traversal( tree, position.left(), depth+1 );
			// perform visit action on position
			inorder_traversal(tree, position.right(), depth+1 );

			</pre>

	=Flags=		=Flags=

Admin at 19:35, 11 June 2017

2017-06-11T19:35:44Z

← Older revision		Revision as of 19:35, 11 June 2017
Line 19:		Line 19:
	[[Category:Binary Trees]]		[[Category:Binary Trees]]
	[[Category:Recursion]]		[[Category:Recursion]]
			[[Category:DFS]]

Admin at 19:35, 11 June 2017

2017-06-11T19:35:20Z

← Older revision		Revision as of 19:35, 11 June 2017
Line 8:		Line 8:

	The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)		The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)


			=Flags=

			{{TreesFlag}}
			{{AlgorithmsFlag}}

			[[Category:Trees]]
			[[Category:Traversal]]
			[[Category:Binary Trees]]
			[[Category:Recursion]]

Admin: Created page with "=Binary Trees - In-order Traversal= ==Basic idea== The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree,..."

2017-06-11T19:34:38Z

Created page with "=Binary Trees - In-order Traversal= ==Basic idea== The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree,..."

New page

=Binary Trees - In-order Traversal=

==Basic idea==

The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree, a recursive definition:

The value of node k is greater than every node in the left subtree of node k. (Left goes first. Left to right precedence.)

The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)