Binary Search Trees C++

Post order traversal :

• 1a+b*c+d*e+f*g

• 1abc*+de*f+g*+

• ++a*bc*+*defg

• abc+*+defg*+*

In Order traversal

• 40 20 50 10 30

• 40 50 20 30 10

• 10 20 30 40 50

• 50 40 20 30 10

What is the MAXIMUM number of nodes in a binary search tree with height = 5 ?

• 2⁶-1

• 2⁵-1

• 2⁵

• 2⁶

• 6

Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

• Pre-Order

• In-Order

• Post-Order

• Monastic Orders

displays data items in a hierarchical view

• Flowchart
• Trees
• Binary Tree
• Binary Expression Tree

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

A Balanced Tree has equal number of items on each subtree.

• True
• False