ou are building a file system structure, and each file or directory can have a maximum of two children. What type of binary tree is most suitable for representing this structure?a)Perfect Binary Treeb)Binary Search Treec)Full Binary Treed)Complete Binary Tree

ou are designing a language syntax tree for a compiler. Each node in the tree represents an operation, and some operations have exactly one child, while others have two children. What type of binary tree is most appropriate for this scenario?a)Full Binary Treeb)Expression Treec)Binary Search Treed)Perfect Binary Tree

What is a full binary tree?a) Each node has exactly zero or two childrenb) Each node has exactly two childrenc) All the leaves are at the same leveld) Each node has exactly one or two children

What is a complete binary tree?OptionsA tree In which all nodes have degree 2 A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to leftEach node has exactly zero or two childrenA binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

A binary tree in which all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

A proper binary tree is a tree in which every node has either 0 or 2 children. Group of answer choicesTrueFalse