Data Structures - Revision history

Admin: Redirected page to Category:Data Structures

2017-06-29T07:01:56Z

Redirected page to Category:Data Structures

← Older revision		Revision as of 07:01, 29 June 2017
Line 1:		Line 1:
	~~List of pages of notes on the wiki related to data structures:~~		#REDIRECT [[:Category:Data Structures]]

	~~==Elementary Data Structures==~~

	An important topic that connects each of the concepts below is [[Abstract Data Types]], which are general implementation interfaces intended to be common to these data containers across both Java and Python

	~~[[Arrays]]~~
	* array-based data structures, storage, and algorithms
	* lower-level structure that can be implemented by many higher-level data structures
	* Python has a built-in array-based list() type, everything (including integers) is reference-based - [[Arrays/Python]]
	* Java has Array type, size must be known at creation time - [[Arrays/Java]]
	* Can implement a Python list type in Java - see [[Arrays/Java/PythonList]]
	* Many data structures below can be implemented under the hood as array-based or linked structure based

	~~[[StacksQueues]]~~
	* Stacks, queues, and deques are important structures for O(1) access to front/back, order in determines order out

	~~[[Lists]]~~
	* Lists have two main implementations - array-based lists (in Python, this is a natural place to start, due to Python's built-in list type) or object- and link-based (in Java, this is more natural due to the way the language principally focuses on objects).
	* [[Linked Lists]] can be implemented in either Python or Java - see [[Linked Lists/Python]] or [[Linked Lists/Java]]
	* [[ArrayLists]] are a type in Java but are also similar to the array-based list data structure built into Python

	[[~~Trees]]~~
	* Tree structures are nonlinear data structures that extend the idea of a linked list node and data pointer organization.
	* A tree is a directed acyclic graph consisting of parent nodes and child nodes, such that all nodes have one parent (except the top-level root node). Typically number of children n is fixed.
	* Nodes without children are leaf nodes/external nodes. Nodes with one or more children are internal nodes.
	* [[Binary Trees]] are a tree structure where each node has a maximum of two children:
	** Each node has a maximum of two children
	** Each child node is labeled as left or right
	* Left precedes right in order of children of a node
	** Proper/full - each node has 0 or 2 children
	** Improper - one or more nodes have 1 child
	* Recursive binary tree definition:
	** A node r, called root of T, stores an element
	** A binary tree, possibly empty, called left subtree of T
	** A binary tree, possibly empty, called right subtree of T
	* [[Binary Trees/LinkedBinTree]]
	* [[Binary Trees/ArrayBinTree]]

	~~[[Graphs]]~~

	~~[[Dictionaries]]~~

	~~==Advanced~~ Data Structures==

	~~[[Search Trees]]~~

	~~[[Heaps]]~~

	~~[[Sets]]~~

	~~[[Hash Tables~~]]

Admin: /* Advanced Data Structures */

2017-06-29T07:01:33Z

Advanced Data Structures

← Older revision		Revision as of 07:01, 29 June 2017
Line 45:		Line 45:

	[[Search Trees]]		[[Search Trees]]

	~~[[Balanced Search Trees]]~~

	~~[[Trees for Set Intervals]]~~

	[[Heaps]]		[[Heaps]]

	[[~~Set Data Structures]]~~		[[Sets]]

	~~[[String Data Structures~~]]

	[[Hash Tables]]		[[Hash Tables]]

	~~[[Hash Trees]]~~

Admin: /* Advanced Data Structures */

2017-06-07T02:30:33Z

Advanced Data Structures

← Older revision		Revision as of 02:30, 7 June 2017
Line 46:		Line 46:
	[[Search Trees]]		[[Search Trees]]

	[[~~Calanced~~ Search Trees]]		[[Balanced Search Trees]]

	[[Trees for Set Intervals]]		[[Trees for Set Intervals]]

Admin: /* Elementary Data Structures */

2017-06-07T02:30:06Z

Elementary Data Structures

← Older revision		Revision as of 02:30, 7 June 2017
Line 38:		Line 38:
	* [[Binary Trees/ArrayBinTree]]		* [[Binary Trees/ArrayBinTree]]

			[[Graphs]]

	[[Dictionaries]]		[[Dictionaries]]

Admin at 02:29, 7 June 2017

2017-06-07T02:29:48Z

← Older revision		Revision as of 02:29, 7 June 2017
Line 40:		Line 40:

	[[Dictionaries]]		[[Dictionaries]]

			==Advanced Data Structures==

			[[Search Trees]]

			[[Calanced Search Trees]]

			[[Trees for Set Intervals]]

			[[Heaps]]

			[[Set Data Structures]]

			[[String Data Structures]]

			[[Hash Tables]]

			[[Hash Trees]]

Admin: /* Elementary Data Structures */

2017-06-07T02:28:17Z

Elementary Data Structures

← Older revision		Revision as of 02:28, 7 June 2017
Line 3:		Line 3:
	==Elementary Data Structures==		==Elementary Data Structures==

	An important topic that connects each of the concepts below is ~~the~~ [[Abstract Data ~~Type~~]], which ~~is a~~ general implementation~~/interface~~ intended to be common to these data containers across both Java and Python		An important topic that connects each of the concepts below is [[Abstract Data Types]], which are general implementation interfaces intended to be common to these data containers across both Java and Python

	[[Arrays]]		[[Arrays]]
Line 35:		Line 35:
	** A binary tree, possibly empty, called left subtree of T		** A binary tree, possibly empty, called left subtree of T
	** A binary tree, possibly empty, called right subtree of T		** A binary tree, possibly empty, called right subtree of T
	* [[Binary Trees/~~Python~~]]		* [[Binary Trees/LinkedBinTree]]
	* [[Binary ~~Search~~ Trees]]		* [[Binary Trees/ArrayBinTree]]



	[[Dictionaries]]		[[Dictionaries]]

Admin: /* Elementary Data Structures */

2017-06-06T23:59:56Z

Elementary Data Structures

← Older revision		Revision as of 23:59, 6 June 2017
Line 2:		Line 2:

	==Elementary Data Structures==		==Elementary Data Structures==

			An important topic that connects each of the concepts below is the [[Abstract Data Type]], which is a general implementation/interface intended to be common to these data containers across both Java and Python

	[[Arrays]]		[[Arrays]]

Admin at 23:58, 6 June 2017

2017-06-06T23:58:32Z

← Older revision		Revision as of 23:58, 6 June 2017
Line 20:		Line 20:

	[[Trees]]		[[Trees]]
	* [[Binary Trees]]		* Tree structures are nonlinear data structures that extend the idea of a linked list node and data pointer organization.
			* A tree is a directed acyclic graph consisting of parent nodes and child nodes, such that all nodes have one parent (except the top-level root node). Typically number of children n is fixed.
			* Nodes without children are leaf nodes/external nodes. Nodes with one or more children are internal nodes.
			* [[Binary Trees]] are a tree structure where each node has a maximum of two children:
			** Each node has a maximum of two children
			** Each child node is labeled as left or right
			* Left precedes right in order of children of a node
			** Proper/full - each node has 0 or 2 children
			** Improper - one or more nodes have 1 child
			* Recursive binary tree definition:
			** A node r, called root of T, stores an element
			** A binary tree, possibly empty, called left subtree of T
			** A binary tree, possibly empty, called right subtree of T
	* [[Binary Trees/Python]]		* [[Binary Trees/Python]]
	* [[Binary Search Trees]]		* [[Binary Search Trees]]



	[[Dictionaries]]		[[Dictionaries]]

Admin at 23:39, 6 June 2017

2017-06-06T23:39:57Z

← Older revision		Revision as of 23:39, 6 June 2017
Line 18:		Line 18:
	* [[Linked Lists]] can be implemented in either Python or Java - see [[Linked Lists/Python]] or [[Linked Lists/Java]]		* [[Linked Lists]] can be implemented in either Python or Java - see [[Linked Lists/Python]] or [[Linked Lists/Java]]
	* [[ArrayLists]] are a type in Java but are also similar to the array-based list data structure built into Python		* [[ArrayLists]] are a type in Java but are also similar to the array-based list data structure built into Python
	*
			[[Trees]]
			* [[Binary Trees]]
			* [[Binary Trees/Python]]
			* [[Binary Search Trees]]


			[[Dictionaries]]

Admin at 23:39, 6 June 2017

2017-06-06T23:39:02Z

← Older revision		Revision as of 23:39, 6 June 2017
Line 8:		Line 8:
	* Python has a built-in array-based list() type, everything (including integers) is reference-based - [[Arrays/Python]]		* Python has a built-in array-based list() type, everything (including integers) is reference-based - [[Arrays/Python]]
	* Java has Array type, size must be known at creation time - [[Arrays/Java]]		* Java has Array type, size must be known at creation time - [[Arrays/Java]]
	* Can implement a Python list type in Java - see [[~~Array~~/Java/PythonList]]		* Can implement a Python list type in Java - see [[Arrays/Java/PythonList]]
	* Many data structures below can be implemented under the hood as array-based or linked structure based		* Many data structures below can be implemented under the hood as array-based or linked structure based