max depth of binary tree

maxdepth.cpp

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
class node{
    public: int data;
    node* left;
    node* right;
node(int data)
{
    this->data = data;
    this->left = NULL;
    this->right = NULL;
}
};
int maxdepth(node* node){
    if(node==NULL)return 0;
    else{
        int ldepth=maxdepth(node->left);
        int rdepth=maxdepth(node->right);

        if(ldepth>rdepth) return(ldepth+1);
        else return(rdepth+1);
    }
}

int main()
{
    node* root = new node(4);
    root->left = new node(2);
    root->right = new node(5);
    root->left->right = new node(1);
    root->left->right=new node(3);
    
   cout<<"max depth of tree is"<<maxdepth(root);
    
    return 0;
}