9-variant 4-лаборатория иши. Яримстатик маълумотлар тузилмасини тадқиқ қилиш

Savol : Berilgan binar daraxtning terminal tugunlari balandliklarini aniqlash algoritmi va dasturini keltiring.
Dastur kodi :

#include

using namespace std;

class node

{

public:

int data;

node* left;

node* right;

};

int maxDepth(node* node)

{

if (node == NULL)

return -1;

else

{

int lDepth = maxDepth(node->left);

int rDepth = maxDepth(node->right);

if (lDepth > rDepth)

return(lDepth + 1);

else return(rDepth + 1);

}

}

node* newNode(int data)

{

node* Node = new node();

Node->data = data;

Node->left = NULL;

Node->right = NULL;

return(Node);

}

int main()

{

node *root = newNode(1);

root->left = newNode(2);

root->right = newNode(3);

root->left->left = newNode(4);

root->left->right = newNode(5);

cout << "daraxt balandligi " << maxDepth(root);

return 0;

}