DATA STRUCTURE

Mehr dazu

Reflective Teaching

von William Marshall

El inicio del proceso cualitativo: planteamiento del problema, revisión de la literatura, surgimiento de las hipótesis e inmersión en el campo.

von Leyla Izaguirre

PAC! Disseny de recursos i activitats en línia - Tere Lluch

von Tere Lluch

Augmented Reality and Education

von Gema Pizarro Jiménez

DATA STRUCTURE

Keywords: group review, preparing for assessment, learning material, learning concepts, group learning, learning with colleagues

Type in the name of the topic from your learning material.

Tree

BST operation

Postorder Traversal − Traverses a tree in a post-order manner.

Inorder Traversal − Traverses a tree in an in-order manner.

Preorder Traversal − Traverses a tree in a pre-order manner.

Search − Searches an element in a tree.

Insert − Inserts an element in a tree/create a tree.

Important term

keys − Key represents a value of a node based on which a search operation is to be carried out for a node.

Levels − Level of a node represents the generation of a node. If the root node is at level 0, then its next child node is at level 1, its grandchild is at level 2, and so on.

Subtree − Subtree represents the descendants of a node.

Leaf − The node which does not have any child node is called the leaf node.

Child − The node below a given node connected by its edge downward is called its child node

Parent − Any node except the root node has one edge upward to a node called parent.

Root − The node at the top of the tree is called root. There is only one root per tree and one path from the root node to any node.

Stack

Storage representation

logical mode

code

Typical applications

memory management

quick sort

syntax parsing and checking

evalution of arithmetic expression

Basic Operation

full

empty

pop

push

create stack

Features

Insert and delete only in one end

FILO

Linear table with limited operations

Introduction data structure

Add a concept you've learned about in the given material, then explain it by adding at least 3 details.

static & dynamic

dynamic

Makes the most efficient use of memory as the data structure only uses as much memory as it needs

size is not fixed at compile time and that can grow and shrink at run time to make efficient use of memory.

static

Can be inefficient as the memory for the data structure has been set aside

Size is fixed at compile time, and does not grow or shrink at runtime.

linear & non- linear

non-linear

Every data item is attached to several other data items in a way that is specific for reflecting relationships. Example : tree and graph

graph

Linear

Traverses the data elements sequentially, in which only one data element can directly be reached.

primitive & non-primitive

Add detail about the concept mentioned.

non primitive

These data types are used to store group of values.

Complicated data structures that are derived from the primitive data structures

primitive

The primitives data type are basic data type that are available

Basic data structures that are directly operated upon by machine level instructions.