Session 06

Question 1

Binary Tree ?

Answer 1

A hierarchical data structure in which each node has at most two children.

Question 2

Types of binary tree?

Answer 2

• Strict Binary Tree :
  each node has either exactly two children or no children.
• Full Binary Tree :
  each node has exactly two children, and all leaf nodes are at the same level.
• Complete Binary Tree :
  1. All levels are completely filled possibly except the last level.
  2. Last level is filled from left to right without any gaps.

Question 3

Applications of Binary Trees?

Answer 3

• Expression trees
• Huffman coding trees
• Binary search trees
• Priority Queue

Question 4

Classifying the tree traversals?

Answer 4

• Preorder (DLR) : Process the current n, process left subtree, then process the right subtree.
• In Order (LDR) : Process the left subtree, process the current node data, and then process the right subtree.
• Post Order (LRD) : Process left subtree, process right subtree and then process the current node data

Question 4

Generic tree (N-ary) ?

Answer 4

Each node can have any number of childrens

Question 5

Threaded Binary Tree (Stack or Queue less) ?

Answer 5

Binary tree that don’t need both stack or queue for traversal.

Question 6

Classifcation of threaded binary tree ?

Answer 6

• Left-threaded BT
• Right-threaded BT
• Fully-threaded BT (simply threaded)

Question 7

Types of Threaded Binary trees ?

Answer 7

• Pre order TBT
• In Order TBT
• Post Order TBT

Question 8

Expression trees ?

Answer 8

Binary tree where internal nodes are operators and leaves are operands.