COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Binary Tree
|
|
|
Binary Expression Tree
|
|
|
Tree
|
|
|
Binary Search Tree
|
Detailed explanation-1: -A binary tree is a rooted tree that is also an ordered tree (a.k.a. plane tree) in which every node has at most two children. A rooted tree naturally imparts a notion of levels (distance from the root), thus for every node a notion of children may be defined as the nodes connected to it a level below.
Detailed explanation-2: -A full binary tree.is a binary tree in which each node has exactly zero or two children. A complete binary tree is a binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right.
Detailed explanation-3: -In a binary search tree, parent nodes can have a maximum of two children. These children are called the “left child” and the “right child”.
Detailed explanation-4: -The nodes from the original tree are internal nodes and the special nodes are external nodes. All external nodes are leaf nodes and the internal nodes are non-leaf nodes. Every internal node has exactly two children and every external node is a leaf.
Detailed explanation-5: -Binary Tree In a normal tree, each node can have any number of children.