Trees

The count of ____ from the root to the node is called the depth of a node.

The height of a _____  is the number of edges on the longest path from that node to a leaf.

The difference between the external path length and the internal path length of a binary tree with n internal nodes is?

50, 70, 60, 20, 90, 10, 40, 100

Construct the BTS

Mention the root node names of subtree from above tree

The no of external nodes in a full binary tree with n internal nodes is?

A strictly binary tree is a tree in which every leaf node has non-empty left and right subtrees.

A complete binary tree with n leaves always contains _____ nodes.

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right is called Complete Binary Tree.

The height of a BST is given as h. Consider the height of the tree as the no. of edges in the longest path from root to the leaf. The maximum no. of nodes possible in the tree is?

 In a full binary tree if number of internal nodes is I, then number of leaves L are?

A binary tree is a rooted tree such that every node has at most two or more children. 

Any successor nodes on the path from the leaf node to that node are called the descendants of that node.

count the leaf nodes from binary tree

Count the Sibling nodes in tree

What is the average case time complexity for finding the height of the binary tree?
 

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right.

Find the height of the tree

Find the correct paths

The number of edges from the root to the node is called __________ of the tree.