What is the maximum number of children that a binary tree node can have?

Related Questions

• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
• A binary tree of depth "d" is an almost complete binary tree if __________.
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• Which of the following pair’s traversals on a binary tree can build the tree uniquely?
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• B-tree of order n is a order-n multiway tree in which each non-root node contains