If node N is a terminal node in a binary tree then its ________ Data Structure
Answer: Both left & right sub trees are empty
No Explanation Available.
Share this question with friends
Two lists, A and B are implemented as singly linked link-lists. The address of the first and last node are stored in variables firstA and lastA for list A and firstB and lastB for list B. Given the address of a node is given in the variable node, the element stored in the node can be accessed by the statement node->data and the address to the next node can be accessed by node->next. Pankaj wants to append list B at end of list A. Which of the following statements should he use?
A terminal node in a binary tree is called __________
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?
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
Which of the following tree data structures is not a balanced binary tree?
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?
A Kind of tree where every node in a tree can have at most two children.
B-tree of order n is a order-n multiway tree in which each non-root node contains __________
Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.
Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
B-tree and AVL tree have the same worst case time complexity for insertion and deletion.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
In preorder traversal of a binary tree the second step is ____________
When traversing a binary tree, which diagram is post-order?
When traversing a binary tree, which diagram is pre-order?
A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
The maximum number of nodes on level I of a binary tree is which of the following? (Root is Level 1)
What is the value of the ROOT node in this Tree?