Workshop 7 - Binary Trees

Question 1

Hierarchral data

Answer 1

Unique presdessor and many sucessors.

Question 2

Binary Search tree

Answer 2

every node is of degrees two or less.

key in left subtree of the root preceeds the key in the root.

key in root node precedes the keys in right tree.

left and right subtrees of the root are also BST.

Question 3

BST Deletion

Answer 3

Three cases:

Case 1 - The node is a leaf node
Case 2 - The node has one subtree.
Case 3 - The node has two subtrees.

Question 4

depth first traersal info

Answer 4

stack is used..

proceeedd along a path from root through one child to most distant descendant of the first child before processsing the second child.

PreOrder,InOrder,PostOrder

leaf by leaf

Question 5

breadth first travesel info

Answer 5

Queue is used.

proceeds horizontally from root of all its children then to its children.

uses a queue.

level by level.

Question 6

depth first traersal

Answer 6

V - Visit node
L - Traverse the Left subtree.
R - Traverse the Right subtree.

Three used:

VLR - PreOrder Traversal
LVR - InOrder Traversal
LRV - PostOrder Traversal

Question 7

breadth first travesel