answersLogoWhite

0

level of a node in any binary tree can be calculated by summing up the number of nodes traversed from the root node of the tree to the node whose level has to be calculated!!!! dats it!!

if count is the no. of elements passed, then floor(log2(count-1)) is the level

User Avatar

Wiki User

14y ago

What else can I help you with?

Continue Learning about Engineering

What is the algorithm to find largest node in a binary search tree?

Since a binary search tree is ordered to start with, to find the largest node simply traverse the tree from the root, choosing only the right node (assuming right is greater and left is less) until you reach a node with no right node. You will then be at the largest node.for (node=root; node!= NULL&&node->right != NULL; node=node->right);This loop will do this. There is no body because all the work is done in the control expressions.


What is the difference between extended binary tree and a binary search tree?

A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.


What is a binary tree?

A binary tree is a data structure consisting of binary nodes. A binary node is a data structure with two branches, each of which may hold a reference to another binary node. These branches are known as the left and right branches respectively. Since the nodes maintain references to every other node in the tree, it is only necessary to keep track of the root node.


What are the properties of binary tree?

A binary tree of n elements has n-1 edgesA binary tree of height h has at least h and at most 2h - 1 elementsThe height of a binary tree with n elements is at most n and at least ?log2 (n+1)?


What is the difference between a binary tree and a complete binary tree?

Let's start with graphs. A graph is a collection of nodes and edges. If you drew a bunch of dots on paper and drew lines between them arbitrarily, you'd have drawn a graph. A directed acyclic graph is a graph with some restrictions: all the edges are directed (point from one node to another, but not both ways) and the edges don't form cycles (you can't go around in circles forever). A tree, in turn, is a directed acyclic graph with the condition that every node is accessible from a single root. This means that every node has a "parent" node and 0 or more "child" nodes, except for the root node which has no parent. A binary tree is a tree with one more restriction: no node may have more than 2 children. More specific than binary trees are balanced binary trees, and more specific than that, heaps. A binary tree can be empty ..whereas the general tree cannot be empty

Related Questions

What is the process of traversing a binary tree level by level, starting from the root node, known as?

The process of traversing a binary tree level by level, starting from the root node, is known as breadth-first search (BFS).


What is difference between full binary tree and balanced binary tree?

A binary tree is considered to be balanced if all of the leaves of the tree are on the same level or at least within one level of each other.A binary tree is considered to be full if all of the leaves of the tree are at the same level and every non leaf node has exactly 2 children.


What is strictly binary tree?

If every non-terminal node (any node except root node whose degree is not zero) in a binary tree consists of non-empty left and right subtree, then such a tree is called strictly binary tree.


explain the process of converting tree to binary tree with example?

A binary tree is a type of tree data structure in which each node has at most two children. To convert a tree to a binary tree, we can follow these steps: Choose a root node for the binary tree. This will be the node at the top of the tree, and all other nodes will be connected to it. For each child node of the root node, add it as a left or right child of the root node, depending on its position relative to the root node. For each child node of the root node, repeat step 2 for its child nodes, adding them as left or right children of the appropriate parent node.


What is the algorithm to find largest node in a binary search tree?

Since a binary search tree is ordered to start with, to find the largest node simply traverse the tree from the root, choosing only the right node (assuming right is greater and left is less) until you reach a node with no right node. You will then be at the largest node.for (node=root; node!= NULL&&node->right != NULL; node=node->right);This loop will do this. There is no body because all the work is done in the control expressions.


How do you calculate the height of a binary tree?

To calculate the height of a binary tree, you can use a recursive algorithm that traverses the tree and keeps track of the height at each level. The height of a binary tree is the maximum depth of the tree, which is the longest path from the root to a leaf node.


What are the differences between a full binary tree and a complete binary tree?

A full binary tree is a tree in which every node has either 0 or 2 children, while a complete binary tree is a tree in which all levels are completely filled except possibly for the last level, which is filled from left to right.


What is the difference between extended binary tree and a binary search tree?

A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.


Differentiate complete and full binary trees?

BINARY TREE ISN'T NECESSARY THAT ALL OF LEAF NODE IN SAME LEVEL BUT COMPLETE BINARY TREE MUST HAVE ALL LEAF NODE IN SAME LEVEL.A complete binary tree may also be defined as a full binary tree in which all leaves are at depth n or n-1 for some n. In order for a tree to be the latter kind of complete binary tree, all the children on the last level must occupy the leftmost spots consecutively, with no spot left unoccupied in between any two. For example, if two nodes on the bottommost level each occupy a spot with an empty spot between the two of them, but the rest of the children nodes are tightly wedged together with no spots in between, then the tree cannot be a complete binary tree due to the empty spot.A full binary tree, or proper binary tree, is a tree in which every node has zero or two children.A perfect binary tree (sometimes complete binary tree) is a full binary tree in which all leaves are at the same depth.Raushan Kumar Singh.


What is a binary tree?

A binary tree is a data structure consisting of binary nodes. A binary node is a data structure with two branches, each of which may hold a reference to another binary node. These branches are known as the left and right branches respectively. Since the nodes maintain references to every other node in the tree, it is only necessary to keep track of the root node.


Definition of threaded binary tree?

A binary tree variant that allows fast traversal: given a pointer to a node in a threaded tree, it is possible to cheaply find its in-order successor (and/or predecessor).


How does binary tree insertion work and what are the key steps involved in inserting a new node into a binary tree?

Binary tree insertion involves adding a new node to a binary tree while maintaining the tree's structure. The key steps in inserting a new node are: Start at the root node and compare the value of the new node with the current node. If the new node's value is less than the current node, move to the left child node. If it is greater, move to the right child node. Repeat this process until reaching a leaf node (a node with no children). Insert the new node as the left or right child of the leaf node, depending on its value compared to the leaf node's value.