Template:TreesFlagBase - Revision history

Admin at 12:19, 7 September 2017

2017-09-07T12:19:22Z

← Older revision		Revision as of 12:19, 7 September 2017
Line 24:		Line 24:
	<br />		<br />

	'''Tree ~~Algorithms~~'''		'''Tree Traversal'''

	~~Traversal algorithms~~: [[Trees/Preorder~~]] {{,}} [[Binary Trees/Inorder]] {{,}} [[Trees/Postorder~~]]		Preorder traversal: [[Trees/Preorder]]

	~~More Traversal Algorithms~~: [[~~BFS]] (Breadth-first search) and [[BFT~~]] ~~(Breadth-first traversal) {{,}} [[DFS]] (depth first search) and [[DFT]] (Depth-first traversal)~~		Postorder traversal: [[Trees/Postorder]]

	[[Trees/~~OOP~~]] ~~{{,}}~~ [[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Template ~~Method Pattern~~]]		In-Order traversal: [[Binary Trees/Inorder]]

			Breadth-First Search: [[BFS]]

			Breadth-First Traversal: [[BFT]]

			Depth-First Search: [[DFS]]

			Depth-First Traversal: [[DFT]]

			OOP Principles for Traversal: [[Tree Traversal/OOP]] {{,}} [[Tree Traversal/Traversal Method Template]]

	Tree operations: [[Trees/Operations Performance]] {{,}} [[Trees/Removal]]		Tree operations: [[Trees/Operations Performance]] {{,}} [[Trees/Removal]]

2017-09-07T12:12:07Z

← Older revision		Revision as of 12:12, 7 September 2017
Line 39:		Line 39:
	'''Tree Applications'''		'''Tree Applications'''

	[[Expression Trees]] ~~{{,}} (Skiena Ch 3) Find Min~~ in Log N Time: [[Tree/LogN Min Search]]		[[Expression Trees]]

			Finding Minimum in Log N Time: [[Tree/LogN Min Search]]

	<br />		<br />

2017-07-10T03:48:55Z

2017-07-04T00:56:56Z

← Older revision		Revision as of 00:56, 4 July 2017
Line 17:		Line 17:
	Abstract data type: [[Trees/ADT]]		Abstract data type: [[Trees/ADT]]

	Concrete implementations: [[Trees/LinkedTree]] {{,}} [[\|Binary Trees/ArrayBinTree\|Trees/ArrayTree]] {{,}} [[SimpleTree]]		Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Binary Trees/ArrayBinTree\|Trees/ArrayTree]] {{,}} [[SimpleTree]]

	<br />		<br />

2017-07-04T00:56:41Z

← Older revision		Revision as of 00:56, 4 July 2017
Line 17:		Line 17:
	Abstract data type: [[Trees/ADT]]		Abstract data type: [[Trees/ADT]]

	Concrete implementations: [[Trees/LinkedTree]] {{,}} [[Trees/ArrayTree]] {{,}} [[SimpleTree]]		Concrete implementations: [[Trees/LinkedTree]] {{,}} [[\|Binary Trees/ArrayBinTree\|Trees/ArrayTree]] {{,}} [[SimpleTree]]

	<br />		<br />

2017-07-02T05:02:22Z

← Older revision		Revision as of 05:02, 2 July 2017
Line 8:		Line 8:

	Part of [[CS\|Computer Science Notes]]		Part of [[CS\|Computer Science Notes]]

			Series on [[Data Structures]]

2017-07-02T04:50:49Z

← Older revision		Revision as of 04:50, 2 July 2017
Line 47:		Line 47:

	[[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/OOP]] {{,}} [[Binary Trees/Implementation Notes]]		[[Binary Trees/Cheat Sheet]] {{,}} [[Binary Trees/OOP]] {{,}} [[Binary Trees/Implementation Notes]]

	~~<br />~~
	~~<br />~~

	~~'''[[Binary Search Trees]]'''~~

	~~Abstract data type: [[Binary Search Trees/ADT]]~~

	~~Implementation: [[Java/Binary Search Trees]]~~

	~~<br />~~
	~~<br />~~

	~~'''[[Heaps]]'''~~

	~~(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:PriorityQueuesFlag]] and [[Priority Queues]].)~~

	~~<br />~~
	~~<br />~~

	~~'''[[Advanced Trees]]'''~~

	~~Types: [[AVL Trees]] {{,}} [[Splay Trees]] {{,}} [[2-4 Trees]] {{,}} [[Red Black Trees]]~~

	<br />		<br />

2017-06-25T00:49:55Z

← Older revision		Revision as of 00:49, 25 June 2017
Line 62:		Line 62:
	'''[[Heaps]]'''		'''[[Heaps]]'''

	(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:~~StacksQueuesFlag~~]] and [[Priority Queues]].)		(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:PriorityQueuesFlag]] and [[Priority Queues]].)

	<br />		<br />

2017-06-25T00:49:00Z

← Older revision		Revision as of 00:49, 25 June 2017
Line 62:		Line 62:
	'''[[Heaps]]'''		'''[[Heaps]]'''

	(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:~~StacksQueues~~]] and [[Priority Queues]].)		(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:StacksQueuesFlag]] and [[Priority Queues]].)

	<br />		<br />

2017-06-25T00:48:11Z

← Older revision		Revision as of 00:48, 25 June 2017
Line 62:		Line 62:
	'''[[Heaps]]'''		'''[[Heaps]]'''

	~~Heaps~~ are ~~implemented as~~ value-sorting trees with ~~minimum~~ at top.		(Note that heaps are also value-sorting trees with minimums at the top. See [[Template:StacksQueues]] and [[Priority Queues]].)

	[[~~Priority Queues~~]] ~~are implemented using~~ [[~~Heaps]].~~

	~~[[Heaps]] are [[Binary Trees~~]] ~~useful for sorting~~.

	<br />		<br />