One ques was that in a binary tree, if node is a leaf, add duplicate nodes there
Anonymous
it was normal traversal and recursive code..if node is a leaf then add node->right = node-> left = new treenode(node->val)
Check out your Company Bowl for anonymous work chats.