Visina ili dubina binarnog stabla može se definirati kao najveći ili najveći broj rubova od lisnog čvora do korijenskog čvora ili korijenskog čvora do lisnog čvora. Korijenski čvor bit će na nultoj razini, što znači da ako korijenski čvor nema niti jedan čvor-djeteš povezan s njim, tada se kaže da je visina ili dubina određenog binarnog stabla nula.

Uzmimo primjer za bolje razumijevanje visine binarnog stabla.

Na gornjoj slici imamo binarno stablo koje počinje od korijenskog čvora nazvanog A. Korijenski čvor A ima dva podređena čvora B i C kao lijevo dijete, odnosno desno dijete. I slično, lijevi čvor dijete B ima samo jedan lijevi čvor dijete pod nazivom D, a desni čvor dijete C ima dva čvora dijete E i F od kojih čvor E ima čvor G kao jedino lijevo dijete.

što je s u pythonu

Sada izračunajmo visinu ovog binarnog stabla. Izbrojite broj rubova počevši od korijenskog čvora do najdubljeg lisnog čvora za izračun visine binarnog stabla. Najdublji čvor koji je prisutan u ovom binarnom stablu je čvor G. Dakle, za izračun visine ili dubine ovog binarnog stabla trebamo izračunati broj bridova između korijenskog čvora i najdubljeg čvora G. Prvi brid je od čvora A do čvora C, drugi rub je od čvora C do čvora E, a treći rub je od čvora E do čvora G. Dakle, za prelazak od korijenskog čvora A do najdubljeg čvora G postoje tri ruba , tako da je visina ili dubina binarnog stabla 3. Put koji smo slijedili da bismo se pomaknuli od korijena do najdubljeg čvora lista je A > C > E > G i ovaj put pokriva tri ruba tijekom obilaska, zato prema prema definiciji visine binarnog stabla, visina ovog binarnog stabla je 3.

Načini pronalaženja visine binarnog stabla

Sada napišimo kod za pronalaženje visine binarnog stabla. Postoje dva načina za pronalaženje visine binarnog stabla. Jedan je rekurzivna metoda a drugi je nerekurzivna metoda koji će koristiti strukturu podataka Queue za izračunavanje visine binarnog stabla.

Rekurzivni način

Prvo, pogledajmo rekurzivan način pronalaženja visine binarnog stabla.

Kodirati:

 // Java program to create and to find the height of a binary tree by recursive way // util package is imported to use classes like Queue and LinkedList import java.util.*; // A class named Node is created representing a single node of a binary tree class Node{ // The class Node has three class variables named key and left and right of int type and Node type respectively. // the key variable holds the actual value that is assigned to that node of the binary tree int key; // left and right variables that are of Node type will be used to store the left and right child nodes of the parent of the binary tree Node left, right; // a parameterized constructor is created to create and add data to the node at the same time. public Node(int item) { key = item; left = right = null; } } // end of node class definition // A public class named BinaryTree is created having two constructors and methods to print the binary tree level-wise. class BinaryTree{ // A static variable named root_node is created that will represent the node of the binary tree static Node root_node; // A parametrized constructor of the BinaryTree class is written having the key as a parameter BinaryTree(int key) { // here we are constructing a new node and assigning it to the root node root_node = new Node(key); } BinaryTree() { root_node = null; } // a public static function named print tree is created to print all the nodes in the tree level-wise starting from the root node public static void printTree() { int h = height(root_node); int i; for (i=1; i<=h; i++){ printcurrentlevel(root_node, i); system.out.println(); } a public static function named height is created to fund the of binary tree starting from root node deepest leaf that present in passed as parameter called recursively until returned null find int height(node root){ then will be zero if (root="=" null) return 0; else { * compute each subtree lheight="height(root.left);" rheight="height(root.right);" use larger one both sub trees calcualted and which higher used. (lheight> rheight) return(lheight+1); else return(rheight+1); } } // a Public static function named printCurrentLevel is created to print al the nodes that are present in that level // this function is called repeatedly for each level of the binary tree to print all the nodes in that particular level public static void printCurrentLevel (Node root ,int level) { if (root == null) return; if (level == 1) System.out.print(root.key + &apos; &apos;); else if (level &gt; 1) { printCurrentLevel(root.left, level-1); printCurrentLevel(root.right, level-1); } } //the main function is created to create an object of the BinaryTree class and call the printTree method to level-wise print the nodes of the binary tree and the height method to find the height of the binary tree public static void main(String[] args){ // first of all we have created an Object of the BinaryTree class that will represent the binary tree BinaryTree tree = new BinaryTree(); // now a new node with the value as 150 is added as the root node to the Binary Tree tree.root_node = new Node(150); // now a new node with the value 250 is added as a left child to the root node tree.root_node.left = new Node(250); // now a new node with the value 270 is added as a right child to the root node tree.root_node.right = new Node(270); // now a new node with the value 320 is added as a left child to the left node of the previous level node tree.root_node.left.left = new Node(320); // now a new node with the value 350 is added as a right child to the right node of the previous level node tree.root_node.left.right = new Node(350); /* 150 /  250 270 /  /  320 350 null null */ System.out.println(&apos;Printing the nodes of tree level wise :&apos;); System.out.println(&apos;Level order traversal : &apos;); tree.printTree(); // height of the binary tree is calculated bypassing the root as parameter to the height() function. int h = tree.height(tree.root_node) System.out.println(&apos;The height of the Binary tree is : &apos; + h ); } } // end of the BinaryTree class </=h;>

Izlaz: Izlaz gornjeg koda je:

 Printing the nodes of tree level wise: Level order traversal: (level 0) 150 (level 1) 250 270 (level 2) 320 350 The height of the Binary tree is: 2 

Na rekurzivan način, pozvali smo visina() više puta pronaći visinu binarnog stabla. Korijenski čvor binarnog stabla prosljeđuje se kao parametar funkciji height(). Funkcija height() izračunava visinu oba podstabla korijenskog čvora i koja je od obje visine veća smatra se visinom binarnog stabla.

Nerekurzivni način

Pogledajmo sada nerekurzivni način za pronalaženje visine binarnog stabla.

Kodirati:

 // A C++ program to create and to find the height of a binary tree by non recursive way // iostream header file is included to use the cin and cout objects of the istream and ostream classes respectively #include #include using namespace std; // A struct named Node is created representing a single node of a binary tree struct Node { // The struct Node has three variables named key and left and right of int type and Node type respectively. // the key variable holds the actual value that is assigned to that node of the binary tree int key; // left and right variables that are of Node type will be used to store the left and right child nodes of the parent of the binary tree struct Node* left, *right; }; // A Function named newNode is created to add a new node to the binary tree, the newNode function has one parameter of integer type named key that will represent the value that particular new node will be storing Node* newNode(int key) { Node* temp = new Node; temp-&gt;key = key; temp-&gt;left = temp-&gt;right = NULL; return (temp); } // A function named height is created to find the height of the binary tree with non recursive way // The parameter to the height function is the root node of the binary tree that will be present at level zero // In the height function the nodes of the binary tree are added into the Queue data structure and the depth variable is incremented until // the NULL node is encountered while traversing the nodes of the binary tree stored in the Queue data structure. int height(struct Node* root){ //Initialising a variable to count the //height of tree int depth = 0; queueq; //Pushing first level element along with NULL q.push(root); q.push(NULL); while(!q.empty()){ Node* temp = q.front(); q.pop(); //When NULL encountered, increment the value if(temp == NULL){ depth++; } //If NULL not encountered, keep moving if(temp != NULL){ if(temp-&gt;left){ q.push(temp-&gt;left); } if(temp-&gt;right){ q.push(temp-&gt;right); } } //If queue still have elements left, //push NULL again to the queue. else if(!q.empty()){ q.push(NULL); } } return depth; } // Start of the main function int main() { // first of all we have created an Object of the struct Node that will represent the binary tree // the value of the root node is 10 Node *root = newNode(10); // now a new node with the value 20 is added as a left child to the root node root-&gt;left = newNode(20); // now a new node with the value 30 is added as a right child to the root node root-&gt;right = newNode(30); // now a new node with the value 40 is added as a left child to the left node of the previous level node root-&gt;left-&gt;left = newNode(40); // now a new node with the value 50 is added as a right child to the left node of the previous level node root-&gt;left-&gt;right = newNode(50); /* 10 /  20 30 /  /  40 50 null null */ cout&lt;<'the height(depth) of tree is: '<<height(root); cout<<endl; } end the main function < pre> <p> <strong>Output:</strong> </p> <pre> The Height(Depth) of the tree is: 2 </pre> <p>In this approach, we have used a non recursive way to find the depth of the binary tree. To find the height of the binary tree, we have written a function named height that will require a parameter of Node type (that means the root of the binary tree whose height needs to be calculated). The root of the binary tree is present at level zero, which means the height or depth of the root is zero.</p> <p>In the non recursive approach, we use the Queue Data Structure to find the depth of the binary tree. The nodes of the binary tree for which we want to find the depth are added to the Queue data structure with the help of an enqueue operation to which the node of the binary tree is passed as a parameter to this function.</p> <p>Once all the nodes are added to the queue, the nodes added in the queue are removed by calling the dequeue function that will keep on removing one element from the queue until the null node of the binary tree is encountered. Each time a node of the binary tree from the queue is removed, the depth variable representing the depth of the binary tree is incremented by one. And in the end, the value of the depth variable will represent the final depth of the binary tree.</p> <hr></'the>

U ovom pristupu koristili smo nerekurzivan način za pronalaženje dubine binarnog stabla. Da bismo pronašli visinu binarnog stabla, napisali smo funkciju pod nazivom visina koja će zahtijevati parametar tipa čvora (što znači korijen binarnog stabla čiju visinu treba izračunati). Korijen binarnog stabla prisutan je na nultoj razini, što znači da je visina ili dubina korijena nula.

U nerekurzivnom pristupu koristimo strukturu podataka čekanja kako bismo pronašli dubinu binarnog stabla. Čvorovi binarnog stabla za koje želimo pronaći dubinu dodaju se strukturi podataka Queue uz pomoć operacije enqueue kojoj se čvor binarnog stabla prosljeđuje kao parametar ovoj funkciji.

preimenuj imenik linux

Nakon što su svi čvorovi dodani u red čekanja, čvorovi dodani u red čekanja uklanjaju se pozivanjem funkcije dequeue koja će nastaviti uklanjati jedan element iz reda dok se ne naiđe na nulti čvor binarnog stabla. Svaki put kada se čvor binarnog stabla ukloni iz reda čekanja, varijabla dubine koja predstavlja dubinu binarnog stabla povećava se za jedan. I na kraju, vrijednost varijable dubine će predstavljati konačnu dubinu binarnog stabla.