Trees/LinkedTree - Revision history

Admin: Replacing charlesreid1.com:3000 with git.charlesreid1.com

2019-10-09T03:58:23Z

Replacing charlesreid1.com:3000 with git.charlesreid1.com

← Older revision		Revision as of 03:58, 9 October 2019
Line 5:		Line 5:
	==Java implementation - linked binary tree==		==Java implementation - linked binary tree==

	A concrete implementation (in Java) of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://charlesreid1.com~~:3000~~/cs/java/src/master/trees/LinkedBinTree.java		A concrete implementation (in Java) of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://git.charlesreid1.com/cs/java/src/master/trees/LinkedBinTree.java

	==Flags==		==Flags==

2017-06-12T22:52:31Z

Linked tree class

← Older revision		Revision as of 22:52, 12 June 2017
Line 2:		Line 2:

	Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list.		Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list.

	~~==Linked tree class==~~

	~~A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])~~

	~~This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).~~

	==Java implementation - linked binary tree==		==Java implementation - linked binary tree==

2017-06-12T22:52:05Z

← Older revision		Revision as of 22:52, 12 June 2017
Line 1:		Line 1:
			Trees are directed acyclic graphs.

			Any tree structure can be implemented using a linked memory structure - the nodes of the tree simply become objects that live in memory, and the tree structure becomes a collection of links, similar to a linked list.

	==Linked tree class==		==Linked tree class==

2017-06-12T22:50:49Z

Linked binary tree

← Older revision		Revision as of 22:50, 12 June 2017
Line 5:		Line 5:
	This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).		This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).

	==~~Linked~~ binary tree==		==Java implementation - linked binary tree==

	A concrete implementation of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://charlesreid1.com:3000/cs/java/src/master/trees/LinkedBinTree.java		A concrete implementation (in Java) of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://charlesreid1.com:3000/cs/java/src/master/trees/LinkedBinTree.java

	==Flags==		==Flags==

2017-06-12T22:50:23Z

← Older revision		Revision as of 22:50, 12 June 2017
Line 4:		Line 4:

	This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).		This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).

			==Linked binary tree==

			A concrete implementation of a binary tree using a link structure for memory is at [[Binary Trees/LinkedBinTree]] - link: https://charlesreid1.com:3000/cs/java/src/master/trees/LinkedBinTree.java

	==Flags==		==Flags==

2017-06-11T01:32:59Z

2017-06-10T22:45:37Z

Linked tree class

← Older revision		Revision as of 22:45, 10 June 2017
Line 3:		Line 3:
	A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])		A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])

	This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory).		This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory) of the Tree ADT (see [[Trees/ADT]]).




	==Flags==		==Flags==

2017-06-10T22:45:21Z

← Older revision		Revision as of 22:45, 10 June 2017
Line 1:		Line 1:
			==Linked tree class==

	A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])		A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])

			This is a concrete implementation (making a decision about the low-level details of how the object will be arranged in memory).




			==Flags==

			{{TreeFlag}}
			[[Category:Trees]]

2017-06-10T22:13:14Z

Created page with "A more generic version of the linked binary tree implementation LinkedBinTree (link: Binary Trees/LinkedBinTree)"

New page

A more generic version of the linked binary tree implementation LinkedBinTree (link: [[Binary Trees/LinkedBinTree]])