Scribd
Upload
6 views

Linked Lists

linked list

Uploaded by

vishalmenaria86
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Linked Lists

linked list

Uploaded by

vishalmenaria86
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Tree

Linked Lists

A linked list consists of nodes with some sort of data, and a pointer, or link, to the next node.

A big benefit with using linked lists is that nodes are stored wherever there is free space in memory,
the nodes do not have to be stored contiguously right after each other like elements are stored in
arrays. Another nice thing with linked lists is that when adding or removing nodes, the rest of the
nodes in the list do not have to be shifted.

Variables in Memory Arrays in Memory Linked Lists in Memory


Tree
The Tree data structure is similar to Linked Lists in that each node contains data and can be linked to
other nodes.

Arrays, Linked Lists, Stacks, and Queues are all linear structures, which means that each element
follows directly after another in a sequence.

In a Tree, a single element can have multiple 'next' elements, allowing the data structure to branch
out in various directions.

The data structure is called a "tree" because it looks like a tree, only upside down,

The first node in a tree is called the root node.

A link connecting one node to another is called an edge.

A parent node has links to its child nodes. Another word for a parent node is internal node.

A node can have zero, one, or many child nodes.

A node can only have one parent node.

Nodes without links to other child nodes are called leaves, or leaf nodes.

The tree height is the maximum number of edges from the root node to a leaf node. The height of
the tree above is 2.

The height of a node is the maximum number of edges between the node and a leaf node.

The tree size is the number of nodes in the tree.


Tree
Types of Trees

Trees are a fundamental data structure in computer science, used to represent hierarchical
relationships. This tutorial covers several key types of trees.

Binary Trees: Each node has up to two children, the left child node and the right child node. This
structure is the foundation for more complex tree types like Binay Search Trees and AVL Trees.

Binary Search Trees (BSTs): A type of Binary Tree where for each node, the left child node has a
lower value, and the right child node has a higher value.
Tree
AVL Trees: A type of Binary Search Tree that self-balances so that for every node, the difference in
height between the left and right subtrees is at most one. This balance is maintained through
rotations when nodes are inserted or deleted.

You might also like