LESSON 7-9

Question 1

is a variable whose value is the address of another variable, i.e., direct address of the memory
location

Answer 1

Pointer

Question 2

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

Answer 2

Pointee

Question 3

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

Answer 3

Dereference

Question 4

This is between two pointers that makes them point to the same pointee

Answer 4

Pointer Assignment

Question 5

is a special Data Structure used for data storage purposes

Answer 5

Binary Tree

Question 6

refers to the sequence of nodes
along the edges of a tree.

Answer 6

Path

Question 7

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.

Answer 7

Root

Question 8

Any node except the root node has one edge upward to a node

Answer 8

Parent

Question 9

The node below a given node
connected by its edge downward

Answer 9

Child

Question 10

The node which does not have any child node

Answer 10

Leaf

Question 11

represents the descendants of a node.

Answer 11

Subtree

Question 12

refers to checking the value of a node when control is on the node

Answer 12

Visiting

Question 13

means passing through nodes in a specific order

Answer 13

Traversing

Question 14

of a node represents the
generation of a node.

Answer 14

Level

Question 15

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

Answer 15

Key

Question 16

exhibits a special behavior

Answer 16

Binary Search tree

Question 17

is a collection of nodes arranged in a way where they maintain BST properties

Answer 17

BST

Question 18

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

Answer 18

Trees

Question 19

immediate root of a node

Answer 19

Parent

Question 20

children of the same parent

Answer 20

Siblings

Question 21

all nodes along the path from the root to that node

Answer 21

Ancestors of a node

Question 22

all nodes of the subtrees of a node

Answer 22

Descendants of a node

Question 23

number of subtrees of a
node

Answer 23

Degree of a node

Question 24

no parents or ancestors

Answer 24

Root node

Question 25

no children or descendants node with a degree = 0

Answer 25

Leaf/terminal node

Question 26

has at least one
child or descendant node with degree <> 0

Answer 26

Nonleaf/nonterminal node

Question 27

= max[degree of nodes]

Answer 27

Degree of a tree

Question 28

1 + length of its path from the root

Answer 28

Level/generation of a node

Question 29

total number of levels

Answer 29

Height/depth of a tree

Question 30

number of leaf nodes

Answer 30

Weight of a tree

Question 31

set of disjoint trees

Answer 31

Forest

Question 32

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

Answer 32

Binary Trees