What’s the difference between root == NULL and
(root -> left == NULL && root -> right == NULL).
Although it’s a silly question but please help me to visualize it!
Binary tree - sum Replacement
hey take linklist for ex
if head ==NULL means if head points to NULL
if head->next ==null if head ke aage vali node null hai ki nahi
same goes for tree
root == null means we are on a null node and (root-left=null && root->right=null) means both child null meaning we are on leaf node
i hope its clear if yes don’t forget to mark the doubt resolved 