Week 10 - 11

Question 1

is composed of nodes with children nodes. The first/top node is called the root node.

Answer 1

A general tree data structure

Question 2

trees rules

Answer 2

1. Node does not reference to there siblings.
2. Child nodes pointed to parent.
3. Two root nodes.

Question 3

The top node in a tree.

Answer 3

Root –

Question 4

A node directly connected to another node when moving away from the root.

Answer 4

Child –

Question 5

The converse notion of a child.

Answer 5

Parent –

Question 6

A group of nodes with the same parent.

Answer 6

Siblings –

Question 7

A node with no children

Answer 7

Leaf –

Question 8

The connection between one node and another.

Answer 8

Edge –

Question 9

is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. This structure is widely used in computer science for various purposes, such as searching, sorting, and hierarchical data organization.

Answer 9

A Binary Tree

Question 10

always has a root node (the node at the top), which is initialized to null before any element is inserted.

Answer 10

A binary tree

Question 11

Binary Tree Rules

Answer 11

1.Maximum Number of Children.
Each node can have at most two children.
2.Hierarchy.
The tree starts from a root node.
Each child node can act as a root for its own subtree.
3.Levels.
The root is at level 0.
Its children are at level 1, their children are at level 2, and so on.
4.Height.
The height of a tree is the number of edges on the longest path from the root to a leaf.
5.Leaf Nodes.
Nodes with no children are called leaf nodes.

Question 12

Each node can have at most two children.

Answer 12

1.Maximum Number of Children.

Question 13

The tree starts from a root node.

Answer 13

2.Hierarchy.

Question 14

The root is at level 0.
Its children are at level 1, their children are at level 2, and so on.

Answer 14

3.Levels.

Question 15

The height of a tree is the number of edges on the longest path from the root to a leaf.

Answer 15

4.Height.

Question 16

Nodes with no children are …

Answer 16

5.Leaf Nodes.

Question 17

Key Properties of a Binary Search Tree (BST)

Answer 17

1. Left Subtree Values:
   All values in the left subtree of a node are less than the node’s value.
2. Right Subtree Values:
   All values in the right subtree of a node are greater than the node’s value.
3. Unique Values:
   Typically, BSTs do not allow duplicate values, although variations allow duplicates (either to the left or right).
4. Root Node:
   The root node is the starting point for searching and inserting values.
5. Efficient Search:
   The binary search property allows for efficient searching. The tree can be traversed from the root down to the correct leaf node by following the left or right child based on comparisons.

Question 18

Basic Operations in a Binary Search Tree

Answer 18

1 search
2. insertion
3. deletion