BST-SR

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

• 2⁶-1

• 
  2⁵-1

• 2⁵

• 
  2⁶

Displays data items in a hierarchical view

• Flowchart

• Trees

• Binary Tree

• Hierarchical Tree

Post order traversal

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

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

• ++a*bc*+*defg

• abc+*+defg*+*

Given a sequence of number below:

50,60,40,70,45,55,30,80,65,35,25,75,85

When creating a binary search tree, what is the height of the tree?

• 
  3

• 4

• 5

• 6

How many parents and childs are there in the tree

• 3 and 6

• 4 and 6

• 3 and 3

• 4 and 5

Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree.

What is the post-order traversal?

• 
  5,15,27,34,47,54,63,70,72,75,83,85,88,94,99,101

• 72,54,34,5,27,15,47,63,70,83,75,88,85,101,94,99

• 15,27,5,47,34,70,63,54,75,85,99,94,101,88,83,72

• 
  15,27,5,47,34,63,54,70,75,85,99,94,101,88,83,72

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

• In-Order

• Pre-Order

• Post-Order

• Level-Order

The run time complexity for traversing all the nodes of a binary search tree with n nodes and printing them in an order is

• 
  O (n log n)

• O (n)

• 
  O (hn)

• O (log n)

What is the preorder traversal of the given binary tree?

• A B D E H I J K L C F G

• 
  A B D H I E J K C F L G

• H D I B J E K A L F C G

• H I D J K E B L F G C A

In a ____, for any node 'n' every descendant node's value in the left subtree is less than n and in the right subtree is greater than n.

• 
  Binary Tree

• Binary Search Tree

• 
  AVL Tree

• Binary Heap Tree