node (data structure)
One element of a linked structure, holding a value and one or more pointers to other nodes.
In more detail
A singly linked list node has a value and a next pointer; a binary tree node has a value and left and right child pointers. In a graph, nodes are also called vertices. The course builds each structure from a small Node class.
Related terms
- linked list — A sequence made of nodes scattered in memory, each holding a value and a pointer to the next node.
- binary tree — A tree in which every node has at most two children, called the left child and the right child.
- pointer — A value that stores the memory location of another piece of data, so the program can follow it to that data.
- vertex — One point in a graph, such as a city on a road map or a person in a social network; also called a node.
Taught in
- Linked Lists: Nodes, Pointers And Sentinels — Algorithms & Data Structures for Working Engineers
- Binary Trees And Their Traversals — Algorithms & Data Structures for Working Engineers
- Binary Search Trees: Search, Insert And Delete — Algorithms & Data Structures for Working Engineers
- AVL Trees: Rotations That Keep The Guarantee — Algorithms & Data Structures for Working Engineers
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers
- Backtracking: Search With Pruning — Algorithms & Data Structures for Working Engineers