LESSON 7-9 Flashcards
is a variable whose value is the address of another variable, i.e., direct address of the memory
location
Pointer
is a term used for the thing that the pointer points to, and stick to the basic properties of the pointer/pointee relationship which are true in all languages
Pointee
operation starts at the pointer and follows its arrow over to access its pointee. The goal may be to look at the pointee state or to change the pointee state
Dereference
This is between two pointers that makes them point to the same pointee
Pointer Assignment
is a special Data Structure used for data storage purposes
Binary Tree
refers to the sequence of nodes
along the edges of a tree.
Path
The node at the top of the tree is
called. There is only one ___ per tree
and one path from the root node to any node.
Root
Any node except the root node has one edge upward to a node
Parent
The node below a given node
connected by its edge downward
Child
The node which does not have any child node
Leaf
represents the descendants of a node.
Subtree
refers to checking the value of a node when control is on the node
Visiting
means passing through nodes in a specific order
Traversing
of a node represents the
generation of a node.
Level
represents a value of a node based on which a search operation is to be carried out for a node
Key
exhibits a special behavior
Binary Search tree
is a collection of nodes arranged in a way where they maintain BST properties
BST
are used in computer science for various tasks, including storing information, representing hierarchical data, and providing efficient algorithms for operations such as insertion, deletion, and
searching
Trees
immediate root of a node
Parent
children of the same parent
Siblings
all nodes along the path from the root to that node
Ancestors of a node
all nodes of the subtrees of a node
Descendants of a node
number of subtrees of a
node
Degree of a node
no parents or ancestors
Root node
no children or descendants node with a degree = 0
Leaf/terminal node
has at least one
child or descendant node with degree <> 0
Nonleaf/nonterminal node
= max[degree of nodes]
Degree of a tree
1 + length of its path from the root
Level/generation of a node
total number of levels
Height/depth of a tree
number of leaf nodes
Weight of a tree
set of disjoint trees
Forest
Finite set of nodes which is either empty or
consisting of a root with at most two branches
to disjoint binary trees called the left subtree
and the right subtree
Binary Trees
