Binary Tree

Question 1

What is a Ternary Tree?

Answer 1

A Ternary Tree is a tree data structure in which each node has at most three child nodes, usually distinguished as ‘left’, ‘mid’, and ‘right’.

Question 2

What is an N-ary Tree or Generic Tree?

Answer 2

Generic trees are a collection of nodes where each node is a data structure that consists of records and a list of references to its children (duplicate references are not allowed). Unlike the linked list, each node stores the address of multiple nodes.

Question 3

What is a Binary Tree?

Answer 3

A Binary Tree is a tree data structure (non-linear) in which each node can have at most two children which are referred to as the left child and the right child.

Question 4

This visits d tree in a syste manner
2.

3. Nodeis v b4 descendant
4. Node is v after descendant
   5nnode is visited after it left seubtree n before its right sub tree

Answer 4

1. Yreetraversal
2. PRE ORDER
3. Inorder
4. Post order

Question 5

What is a Binary Tree?

Answer 5

A Binary Tree is a tree data structure (non-linear) in which each node can have at most two children which are referred to as the left child and the right child.